Integer programming formulations for the elementary shortest path problem
- 1 July 2016
- journal article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 252 (1), 122-130
- https://doi.org/10.1016/j.ejor.2016.01.003
Abstract
No abstract availableThis publication has 25 references indexed in Scilit:
- The orienteering problem: A surveyEuropean Journal of Operational Research, 2011
- A strong flow‐based formulation for the shortest path problem in digraphs with negative cyclesInternational Transactions in Operational Research, 2009
- Accelerated label setting algorithms for the elementary resource constrained shortest path problemOperations Research Letters, 2006
- Projection, Lifting and Extended Formulation in Integer and Combinatorial OptimizationAnnals of Operations Research, 2005
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problemsNetworks, 2004
- A branch and cut approach to the cardinality constrained circuit problemMathematical Programming, 2002
- The prize collecting traveling salesman problemNetworks, 1989
- An algorithm for the resource constrained shortest path problemNetworks, 1989
- A new approach to the maximum-flow problemJournal of the ACM, 1988
- Integer Programming Formulation of Traveling Salesman ProblemsJournal of the ACM, 1960