Research of MIP-HCO Model Based on k-Nearest Neighbor and Branch-and-Bound Algorithms in Aerospace Emergency Launch Missions
This study proposes a mixed-integer programming-based hierarchical collaborative optimization (MIP-HCO) model to optimize the scheduling and execution of emergency launch missions, ensuring rapid response and performance maximization under constrained time and resources. The key innovation lies in i...
Saved in:
| Main Authors: | Xiangzhe Li, Feng Zhan, Jinqing Huang, Yan Chen |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-05-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/13/10/1652 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Enhancing SR-Tree for Nearest Neighbor Search
by: Kayumov Abduaziz, et al.
Published: (2025-01-01) -
Application of Data Mining for Tuberculosis Disease Classification Using K-Nearest Neighbor
by: Delima Sitanggang, et al.
Published: (2024-11-01) -
A new locally adaptive K-nearest centroid neighbor classification based on the average distance
by: Benqiang Wang, et al.
Published: (2022-12-01) -
NNG-Based Secure Approximate k-Nearest Neighbor Query for Large Language Models
by: Heng Zhou, et al.
Published: (2025-07-01) -
Deduplication algorithm based on condensed nearest neighbor rule for deduplication metadata
by: Wen-bin YAO, et al.
Published: (2015-08-01)