Valid inequalities for the synchronization bus timetabling problem.
Pierre FouilhouxOmar Jorge Ibarra-RojasSafia Kedad-SidhoumYasmín Á. Ríos-SolísPublished in: Eur. J. Oper. Res. (2016)
Keyphrases
- timetabling problem
- valid inequalities
- integer programming
- traveling salesman problem
- memetic algorithm
- linear programming
- mixed integer
- mixed integer programming
- cutting plane
- feasible solution
- convex hull
- examination timetabling
- lower and upper bounds
- hyper heuristics
- network design problem
- primal dual
- column generation
- facet defining inequalities
- combinatorial optimization
- integer program
- optimal solution
- facet defining
- lagrangian relaxation
- tabu search
- ant colony optimization
- continuous variables
- constraint programming
- linear program
- evolutionary algorithm
- lower bound