Valid inequalities for the arc flow formulation of the railway crew scheduling problem with attendance rates.
Kirsten HoffmannUdo BuscherPublished in: Comput. Ind. Eng. (2019)
Keyphrases
- valid inequalities
- set partitioning
- network flow problem
- integer programming
- linear relaxation
- mixed integer
- column generation
- network design problem
- traveling salesman problem
- mixed integer programming
- cutting plane algorithm
- linear programming
- cutting plane
- linear programming relaxation
- convex hull
- vehicle routing problem with time windows
- lower and upper bounds
- mixed integer linear programs
- integer program
- feasible solution
- integer programming formulation
- randomly generated problems
- primal dual
- linear program
- optimal solution
- mixed integer program
- branch and bound
- lower bound
- lagrangian relaxation
- continuous variables
- lot sizing
- lp relaxation
- knapsack problem
- production planning
- facet defining inequalities
- network flow
- genetic algorithm
- constraint programming
- tabu search
- metaheuristic
- np hard
- objective function