Valid inequalities for the k-Color Shortest Path Problem.
Rafael Castro de AndradeEmanuel Elias Silva CasteloRommel Dias SaraivaPublished in: Eur. J. Oper. Res. (2024)
Keyphrases
- shortest path problem
- valid inequalities
- shortest path
- traveling salesman problem
- integer programming
- combinatorial optimization problems
- mixed integer programming
- linear programming
- mixed integer
- lower and upper bounds
- mixed integer linear programs
- cutting plane algorithm
- cutting plane
- feasible solution
- column generation
- facet defining inequalities
- lagrangian relaxation
- convex hull
- network design problem
- multiple objectives
- directed acyclic graph
- integer program
- directed graph
- np hard
- primal dual
- facet defining
- knapsack problem
- combinatorial optimization
- linear program
- lower bound
- continuous variables
- probability distribution
- dynamic programming
- evolutionary algorithm
- search algorithm
- optimal solution
- neural network