Valid Inequalities for Time-Indexed Formulations of the Runway Scheduling Problem.
Igor VasilyevPasquale AvellaMaurizio BocciaCarlo ManninoPublished in: DOOR (Supplement) (2016)
Keyphrases
- valid inequalities
- scheduling problem
- integer programming
- np hard
- traveling salesman problem
- feasible solution
- tabu search
- linear programming
- mixed integer
- mixed integer programming
- lower and upper bounds
- cutting plane algorithm
- cutting plane
- convex hull
- mixed integer linear programs
- network design problem
- column generation
- vehicle routing problem with time windows
- linear programming relaxation
- lagrangian relaxation
- integer program
- integer programming formulation
- primal dual
- optimal solution
- continuous variables
- lower bound
- combinatorial optimization
- linear program
- branch and bound algorithm
- facet defining inequalities
- ant colony optimization
- lp relaxation
- optimization problems
- approximation algorithms
- objective function