New formulations for the elementary shortest-path problem visiting a given set of nodes

DOI10.1016/j.ejor.2016.05.008zbMath1346.90784OpenAlexW2355126332MaRDI QIDQ323412

Rafael Castro de Andrade

Publication date: 7 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2016.05.008

zbMATH Keywords

combinatorial optimizationcompact extended formulationprimal-dual formulationshortest-path visiting given nodes

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)

Uses Software

• TSPLIB

Cites Work

• Unnamed Item
• Compact formulations of the Steiner traveling salesman problem and related problems
• Using separation algorithms to generate mixed integer model reformulations
• Expressing combinatorial optimization problems by linear programs
• Lower tolerance-based branch and bound algorithms for the ATSP
• Tolerance-based branch and bound algorithms for the ATSP
• Stochastic maximum weight forest problem
• The Routing Problem with “K” Specified Nodes
• An Appraisal of Some Shortest-Path Algorithms
• Algorithms for Obtaining Shortest Paths Visiting Specified Nodes
• Extended formulations in combinatorial optimization

This page was built for publication: New formulations for the elementary shortest-path problem visiting a given set of nodes