Train stop scheduling problem: An exact approach using valid inequalities and polar duality.
Faiz HamidYogesh Kumar AgarwalPublished in: Eur. J. Oper. Res. (2024)
Keyphrases
- valid inequalities
- scheduling problem
- linear programming
- np hard
- integer programming
- feasible solution
- tabu search
- cutting plane algorithm
- mixed integer programming
- mixed integer linear programs
- column generation
- traveling salesman problem
- network design problem
- linear programming relaxation
- linear program
- mixed integer
- convex hull
- cutting plane
- lower and upper bounds
- primal dual
- vehicle routing problem with time windows
- integer programming formulation
- optimal solution
- job shop scheduling problem
- lagrangian relaxation
- integer program
- objective function
- exact solution
- facet defining inequalities
- lower bound
- network flow
- dynamic programming
- special case
- knapsack problem
- np complete
- facet defining