The Steiner traveling salesman problem and its extensions
From MaRDI portal
Publication:1999396
DOI10.1016/j.ejor.2019.04.047zbMath1430.90551OpenAlexW2944565881WikidataQ127905827 ScholiaQ127905827MaRDI QIDQ1999396
Jessica Rodríguez-Pereira, Gilbert Laporte, Enrique Benavent, Elena Fernández, Antonio Martínez-Sykora
Publication date: 26 June 2019
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2019.04.047
Related Items
Vehicle routing on road networks: how good is Euclidean approximation? ⋮ Improving a constructive heuristic for the general routing problem ⋮ The capacitated family traveling salesperson problem
Cites Work
- Unnamed Item
- Compact formulations of the Steiner traveling salesman problem and related problems
- Stronger multi-commodity flow formulations of the capacitated vehicle routing problem
- A Branch-and-Cut method for the Capacitated Location-Routing Problem
- Solving the prize-collecting rural postman problem
- A cutting plane procedure for the travelling salesman problem on road networks
- On the cycle polytope of a binary matroid
- New inequalities for the general routing problem
- The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra
- The capacitated arc routing problem: Valid inequalities and facets
- A branch-and-cut algorithm for the undirected rural postman problem
- The generalized arc routing problem
- The general routing polyhedron: A unifying framework
- Multi-depot rural postman problems
- The traveling salesman problem on a graph and some related integer polyhedra
- Computational comparison of two methods for finding the shortest complete cycle or circuit in a graph
- A fundamental problem in vehicle routing
- Transformation of Facets of the General Routing Problem Polytope
- On the Relation Between the Traveling-Salesman and the Longest-Path Problems
- A cutting plane algorithm for the general routing problem
