The travelling salesman problem as a constrained shortest path problem: Theory and computational experience
From MaRDI portal
Publication:1146121
Cited in
(35)- Freight railway operator timetabling and engine scheduling
- A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands
- Robust Team Orienteering Problem with Decreasing Profits
- New techniques for cost sharing in combinatorial optimization games
- A stochastic dynamic traveling salesman problem with hard time windows
- Microcomputer-based algorithms for large scale shortest path problems
- Accelerated label setting algorithms for the elementary resource constrained shortest path problem
- An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems
- A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
- Real-time vehicle rerouting problems with time windows
- The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times
- Optimal toll design: a lower bound framework for the asymmetric traveling salesman problem
- Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems
- A dynamic programming based algorithm for the crew scheduling problem.
- Column Generation Algorithms for the Capacitated m-Ring-Star Problem
- Formulations and exact algorithms for the vehicle routing problem with time windows
- A branch-and-price algorithm for capacitated arc routing problem with flexible time windows
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- The shortest path problem with forbidden paths
- The hazardous orienteering problem
- MIP modelling of changeovers in production planning and scheduling problems
- A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times
- A survey of resource constrained shortest path problems: exact solution approaches
- Bounding the optimum for the problem of scheduling the photographs of an agile Earth observing satellite
- Compact formulations of the Steiner traveling salesman problem and related problems
- Lagrangian duality applied to the vehicle routing problem with time windows
- Convergent duality for the traveling salesman problem
- A column generation approach to the heterogeneous fleet vehicle routing problem
- A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem
- A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands
- A computational study of solution approaches for the resource constrained elementary shortest path problem
- A rollout algorithm for the resource constrained elementary shortest path problem
- The shortest-path problem with resource constraints with \((k, 2)\)-loop elimination and its application to the capacitated arc-routing problem
- A profit-maximization location-routing-pricing problem: a branch-and-price algorithm
- Partial dominance in branch-price-and-cut algorithms for vehicle routing and scheduling problems with a single-segment tradeoff
This page was built for publication: The travelling salesman problem as a constrained shortest path problem: Theory and computational experience
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1146121)
