Solving elementary shortest-path problems as mixed-integer programs.
Michael DrexlStefan IrnichPublished in: OR Spectr. (2014)
Keyphrases
- mixed integer program
- shortest path problem
- feasible solution
- linear program
- lot sizing
- shortest path
- mixed integer
- cutting plane
- mip solver
- lagrangian relaxation
- combinatorial optimization problems
- mathematical model
- linear programming
- objective function
- np hard
- random variables
- graph cuts
- directed graph
- markov random field
- upper bound
- lower bound
- neural network