Integer programming formulations for the elementary shortest path problem

•We compare integer programming formulations for the elementary shortest path problem.•We describe IP formulations with exponentially-many SECs and MIP extended formulations of polynomial size.•We study the polyhedral structure of the two strongest formulations and prove their LP bounds are equivale...

Full description

Saved in:

Bibliographic Details
Published in:	European journal of operational research Vol. 252; no. 1; pp. 122 - 130
Main Author:	Taccari, Leonardo
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 01.07.2016 Elsevier Sequoia S.A
Subjects:	Branch-and-cut Comparative analysis Computation Costs Effectiveness studies Elementary shortest path Extended formulations Formulations Graph theory Graphs Inequalities Integer programming Linear programming Mathematical analysis Mathematical problems Polyhedra Shortest path algorithms Shortest-path problems Subtour elimination constraints Integer programming Subtour elimination constraints Extended formulations Branch-and-cut Elementary shortest path
ISSN:	0377-2217, 1872-6860
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!