An integer programming approach to support the US Air Force's air mobility network.
Corbin G. KoepkeAndrew P. ArmacostCynthia BarnhartStephan E. KolitzPublished in: Comput. Oper. Res. (2008)
Keyphrases
- integer programming
- air force
- network flow
- np hard
- linear programming
- production planning
- cutting plane
- set covering problem
- network design problem
- mobile networks
- lagrangian relaxation
- network configuration
- cutting plane algorithm
- transportation problem
- network model
- constraint programming
- united states
- ai planning
- integer program
- valid inequalities
- column generation
- inference problems
- set covering
- lower bound
- network design
- facility location
- vehicle routing problem with time windows
- branch and bound algorithm
- integer programming formulations