Solving the shortest path tour problem

DOI10.1016/J.EJOR.2013.04.029MaRDI QIDQ2356016zbMATH OpenOpenAlexWikidataFDO

Authors Paola Festa, Demetrio Laganà, Roberto Musmanno, Francesca Guerriero

Publication date 28 July 2015

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2013.04.029

zbMATH Keywords

labeling methodnetwork flowsshortest pathstructure path constraints

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Recommendations

• Complexity analysis and optimization of the shortest path tour problem
• The constrained shortest path tour problem
• An efficient exact approach for the constrained shortest path tour problem
• Constrained shortest path tour problem: branch-and-price algorithm
• A generalized shortest path tour problem with time windows

Cites work

• A Class of Label-Correcting Methods for the K Shortest Paths Problem
• A note on two problems in connexion with graphs
• A simple and fast label correcting algorithm for shortest paths
• Algorithms for the weight constrained shortest path problem
• An efficient algorithm for concurrent priority queue heaps
• An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
• Complexity analysis and optimization of the shortest path tour problem
• Dynamic programming and optimal control. Vol. 1.
• Dynamic programming approaches to solve the shortest path problem with forbidden paths
• scientific article; zbMATH DE number 53116 (Why is no real title available?)
• Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem
• Introduction to algorithms
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• New dynamic programming algorithms for the resource constrained elementary shortest path problem
• Shortest chain subject to side constraints
• Shortest path problem with forbidden paths: the elementary version
• Shortest paths algorithms: Theory and experimental evaluation
• Simultaneous solution of Lagrangean dual problems interleaved with preprocessing for the weight constrained shortest path problem

Cited in

(16)

• A two-level metaheuristic for the all colors shortest path problem
• A generalized shortest path tour problem with time windows
• Constrained shortest path tour problem: branch-and-price algorithm
• Shortest path tour problem with time windows
• New formulations for the elementary shortest-path problem visiting a given set of nodes
• The constrained shortest path tour problem
• AN APPROACH TO TRIP- AND ROUTE-PLANNING PROBLEMS
• An efficient exact approach for the constrained shortest path tour problem
• Constrained shortest path tour problem: models, valid inequalities, and Lagrangian heuristics
• The constrained forward shortest path tour problem: Mathematical modeling and GRASP approximate solutions
• Shortest paths with exclusive-disjunction arc pairs conflicts
• Algorithms for shortest path tour problem in large-scale road network
• Algorithms for shortest path tour problem
• Complexity analysis and optimization of the shortest path tour problem
• The ripple-spreading algorithm for shortest path tour problems
• The quickest path problem

Describes a project that uses

Uses Software

• NETGEN
• Algorithm 97

This page was built for publication: Solving the shortest path tour problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2356016)