Δ-MILP: Deep Space Network Scheduling via Mixed-Integer Linear Programming.
Thomas ClaudetRyan AlimoEdwin GohMark JohnstonRamtin MadaniBrian WilsonPublished in: CoRR (2021)
Keyphrases
- mixed integer linear programming
- deep space
- branch and bound algorithm
- production planning
- cutting plane
- mathematical programming
- mixed integer linear program
- mixed integer
- lower bound
- scheduling problem
- approximate solutions
- integer programming
- network structure
- column generation
- knapsack problem
- upper bound
- resource constraints