Solving elementary shortest-path problems as mixed-integer programs
From MaRDI portal
Publication:2454365
DOI10.1007/s00291-012-0302-7zbMath1290.90082OpenAlexW2138121296MaRDI QIDQ2454365
Publication date: 13 June 2014
Published in: OR Spectrum (Search for Journal in Brave)
Full work available at URL: https://download.uni-mainz.de/RePEc/pdf/Discussion_Paper_1201.pdf
Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Linear programming (90C05) Paths and cycles (05C38)
Related Items (6)
Integer programming formulations for the elementary shortest path problem ⋮ Exact approaches to the robust vehicle routing problem with time windows and multiple deliverymen ⋮ Exact methods for solving the elementary shortest and longest path problems ⋮ Exact solution of the soft-clustered vehicle-routing problem ⋮ A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints ⋮ On the shortest path problem with negative cost cycles
Uses Software
Cites Work
- Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
- The vehicle routing problem. Latest advances and new challenges.
- Solving the prize-collecting rural postman problem
- The traveling salesman problem and its variations
- Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- Accelerated label setting algorithms for the elementary resource constrained shortest path problem
- The Vehicle Routing Problem
- The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k ≥ 3
- A strong flow-based formulation for the shortest path problem in digraphs with negative cycles
- Shortest Path Problems with Resource Constraints
- Unnamed Item
- Unnamed Item
This page was built for publication: Solving elementary shortest-path problems as mixed-integer programs
