Constrained shortest path tour problem: models, valid inequalities, and Lagrangian heuristics

DOI10.1111/itor.12782OpenAlexW3008779020MaRDI QIDQ6070419

Rafael Castro de Andrade, Rommel Dias Saraiva

Publication date: 21 November 2023

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.12782

zbMATH Keywords

combinatorial optimizationnetwork flowLagrangian heuristicconstrained shortest path tour problem

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (2)

Constrained shortest path tour problem: branch-and-price algorithm ⋮ A generalized shortest path tour problem with time windows

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• The constrained shortest path tour problem
• Complexity analysis and optimization of the shortest path tour problem
• Network survivability modeling
• The edge Hamiltonian path problem is NP-complete
• Impossible pair constrained test path generation in a program
• Solving the shortest path tour problem
• An efficient exact approach for the constrained shortest path tour problem

This page was built for publication: Constrained shortest path tour problem: models, valid inequalities, and Lagrangian heuristics