The constrained shortest path tour problem

DOI10.1016/j.cor.2016.04.002zbMath1349.90812OpenAlexW2336786694WikidataQ58921010 ScholiaQ58921010MaRDI QIDQ342457

Francesca Guerriero, Demetrio Laganà, Daniele Ferone, 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 optimizationGRASPnetwork flow problemsbranch \& boundshortest path problems

Mathematics Subject Classification ID

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

Related Items (13)

Solution approaches for the vehicle routing problem with occasional drivers and time windows ⋮ A GRASP with penalty objective function for the green vehicle routing problem with private capacitated stations ⋮ Constrained shortest path tour problem: branch-and-price algorithm ⋮ 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 ⋮ Efficient GRASP solution approach for the prisoner transportation problem ⋮ Shortest path tour problem with time windows ⋮ An auction-based approach for the re-optimization shortest path tree problem ⋮ An efficient exact approach for the constrained shortest path tour problem ⋮ Design of experiment for tuning parameters of an ant colony optimization method for the constrained shortest Hamiltonian path problem in the grid networks ⋮ A generalized shortest path tour problem with time windows ⋮ An exact reduction technique for the k-colour shortest path problem

Uses Software

• GRASP

Cites Work

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

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