Chrome Extension
WeChat Mini Program
Use on ChatGLM
VIPCreated with Sketch.

The Steiner Traveling Salesman Problem and its extensions.

Jessica Rodríguez-Pereira,Elena Fernández,Gilbert Laporte,Enrique Benavent,Antonio Martinez-Sykora

European Journal of Operational Research（2019）

Cited 16|Views32
No score
Abstract
•We study the Steiner Traveling Salesman Problem and some extensions.•We propose compact integer linear programming formulations with 2-index variables.•Exact branch-and-cut algorithms are designed and implemented.•Instances with up to 500 vertices are optimally solved in moderated computing time.
More
Translated text
Key words
Steiner Traveling Salesman Problem,Integer linear programming,Branch-and-cut,Valid inequalities
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined