The constrained shortest path tour problem

DOI10.1016/J.COR.2016.04.002MaRDI QIDQ342457zbMATH OpenOpenAlexWikidataFDO

Authors Daniele Ferone, Francesca Guerriero, Demetrio Laganà, Paola Festa

Publication date 17 November 2016

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2016.04.002

zbMATH Keywords

combinatorial optimizationGRASPbranch \& boundnetwork flow problemsshortest path problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Directed graphs (digraphs), tournaments (05C20) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Recommendations

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

Cites work

• A note on two problems in connexion with graphs
• A probabilistic heuristic for a computationally difficult set covering problem
• An annotated bibliography of GRASP – Part I: Algorithms
• An annotated bibliography of GRASP-Part II: Applications
• Complexity analysis and optimization of the shortest path tour problem
• Dynamic programming and optimal control. Vol. 1.
• GRASP: An annoted bibliography
• Greedy randomized adaptive search procedures
• Network survivability modeling
• Reducibility among combinatorial problems
• Solving the shortest path tour problem
• The edge Hamiltonian path problem is NP-complete

Cited in

(19)

• Reliable production process design problem: compact MILP model and ALNS-based primal heuristic
• Efficient GRASP solution approach for the prisoner transportation problem
• Shortest paths with exclusive-disjunction arc pairs conflicts
• Shortest path tour problem with time windows
• Design of experiment for tuning parameters of an ant colony optimization method for the constrained shortest Hamiltonian path problem in the grid networks
• scientific article; zbMATH DE number 1445588 (Why is no real title available?)
• Constrained shortest path tour problem: branch-and-price algorithm
• An exact reduction technique for the k-colour shortest path problem
• A generalized shortest path tour problem with time windows
• Solving the shortest path tour problem
• Constrained shortest path tour problem: models, valid inequalities, and Lagrangian heuristics
• Solution approaches for the vehicle routing problem with occasional drivers and time windows
• The constrained forward shortest path tour problem: Mathematical modeling and GRASP approximate solutions
• Complexity analysis and optimization of the shortest path tour problem
• Introduction to routing problems with mandatory transitions
• An efficient exact approach for the constrained shortest path tour problem
• A GRASP with penalty objective function for the green vehicle routing problem with private capacitated stations
• An auction-based approach for the re-optimization shortest path tree problem
• Fault-tolerant families of production plans: mathematical model, computational complexity, and branch-and-bound algorithms

Describes a project that uses

Uses Software

• GRASP

This page was built for publication: The constrained shortest path tour problem

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