The Steiner traveling salesman problem and its extensions
type: Item
instance of: scholarly article
title: The Steiner traveling salesman problem and its extensions
zbMATH Open document ID: 1430.90551
author: Jessica Rodríguez-Pereira
author: Elena Fernández
author: G. Laporte
author: Enrique Benavent
author: Antonio Martínez-Sykora
published in: European Journal of Operational Research
publication date: 2019-06-26T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 7073793
zbMATH Keywords: Steiner traveling salesman problem
zbMATH Keywords: integer linear programming
zbMATH Keywords: branch-and-cut
zbMATH Keywords: valid inequalities
MaRDI profile type: Publication
full work available at URL: j.ejor.2019.04.047
OpenAlex ID: W2944565881
cites work: The generalized arc routing problem
cites work: Solving the prize-collecting rural postman problem
cites work: On the cycle polytope of a binary matroid
cites work: The capacitated arc routing problem: Valid inequalities and facets
cites work: A Branch-and-Cut method for the Capacitated Location-Routing Problem
cites work: A cutting plane algorithm for the general routing problem
cites work: The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra
cites work: The traveling salesman problem on a graph and some related integer polyhedra
cites work: Multi-depot rural postman problems
cites work: A cutting plane procedure for the travelling salesman problem on road networks
cites work: A branch-and-cut algorithm for the undirected rural postman problem
cites work: On the Relation Between the Traveling-Salesman and the Longest-Path Problems
cites work: New inequalities for the general routing problem
cites work: The general routing polyhedron: A unifying framework
cites work: Compact formulations of the Steiner traveling salesman problem and related problems
cites work: Stronger multi-commodity flow formulations of the capacitated vehicle routing problem
cites work: Computational comparison of two methods for finding the shortest complete cycle or circuit in a graph
cites work: A fundamental problem in vehicle routing
cites work: Q3714901
cites work: Transformation of Facets of the General Routing Problem Polytope
Wikidata QID: Q127905827
DOI: 10.1016/J.EJOR.2019.04.047
Recommended article: A note on computational aspects of the Steiner traveling salesman problem
Recommended article: Compact formulations of the Steiner traveling salesman problem and related problems
Recommended article: The Steiner Traveling Salesman Polytope and Related Polyhedra
Recommended article: The Steiner travelling salesman problem with correlated costs
Recommended article: Q4400842
Recommended article: Steiner tree problems
Recommended article: Q3059314
Recommended article: The traveling salesman problem and its variations
description: scientific article; zbMATH DE number 7073793