Research of MIP-HCO Model Based on k-Nearest Neighbor and Branch-and-Bound Algorithms in Aerospace Emergency Launch Missions

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...

Full description

Saved in:
Bibliographic Details
Main Authors: Xiangzhe Li, Feng Zhan, Jinqing Huang, Yan Chen
Format: Article
Language:English
Published: MDPI AG 2025-05-01
Series:Mathematics
Subjects:
mixed-integer programming
branch and bound
k-nearest neighbors
aerospace emergency launch
Online Access:https://www.mdpi.com/2227-7390/13/10/1652
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

https://www.mdpi.com/2227-7390/13/10/1652

Similar Items