Login / Signup
A note on the separation of subtour elimination constraints in elementary shortest path problems.
Michael Drexl
Published in:
Eur. J. Oper. Res. (2013)
Keyphrases
</>
shortest path problem
subtour elimination
traveling salesman problem
combinatorial optimization problems
shortest path
multiple objectives
lp relaxation
neural network
image segmentation
optimization problems
combinatorial optimization
constraint programming
knapsack problem