Valid inequalities and lifting procedures for the shortest path problem in digraphs with negative cycles.
Mamane Souley IbrahimNelson MaculanMichel MinouxPublished in: Optim. Lett. (2015)
Keyphrases
- shortest path problem
- valid inequalities
- facet defining
- directed graph
- traveling salesman problem
- combinatorial optimization problems
- shortest path
- integer programming
- facet defining inequalities
- mixed integer
- linear programming
- mixed integer programming
- cutting plane algorithm
- cutting plane
- column generation
- mixed integer linear programs
- feasible solution
- convex hull
- lower and upper bounds
- lagrangian relaxation
- integer program
- primal dual
- multiple objectives
- directed acyclic graph
- network design problem
- neural network
- ant colony optimization
- vehicle routing problem
- combinatorial optimization
- multistage
- data points