A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for routing problems with time windows.
Yuan YuanDiego CattaruzzaMaxime OgierFrédéric SemetPublished in: Oper. Res. Lett. (2020)
Keyphrases
- subtour elimination
- routing problem
- traveling salesman problem
- miller tucker zemlin
- vehicle routing problem
- vehicle routing
- combinatorial optimization
- multi commodity
- ant colony optimization
- depth first search
- optimization problems
- metaheuristic
- valid inequalities
- graphical models
- travel time
- belief propagation
- tabu search
- benchmark problems
- dynamic programming
- heuristic solution