Integer programming formulations for the elementary shortest path problem
type: Item
instance of: scholarly article
title: Integer programming formulations for the elementary shortest path problem
zbMATH Open document ID: 1346.90793
author: L. Taccari
published in: European Journal of Operational Research
publication date: 2016-10-07T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 6636203
zbMATH Keywords: integer programming
zbMATH Keywords: elementary shortest path
zbMATH Keywords: branch-and-cut
zbMATH Keywords: extended formulations
zbMATH Keywords: subtour elimination constraints
describes a project that uses: Concorde
describes a project that uses: LEMON
describes a project that uses: DIMACS
describes a project that uses: SNDlib
MaRDI profile type: Publication
full work available at URL: j.ejor.2016.01.003
OpenAlex ID: W2233296499
cites work: Maximum Throughput Network Routing Subject to Fair Flow Allocation
cites work: Q3425132
cites work: The prize collecting traveling salesman problem
cites work: Projection, lifting and extended formulation integer and combinatorial optimization
cites work: A branch and cut approach to the cardinality constrained circuit problem.
cites work: An algorithm for the resource constrained shortest path problem
cites work: Automata, Languages and Programming
cites work: Accelerated label setting algorithms for the elementary resource constrained shortest path problem
cites work: A New Formulation for the Travelling Salesman Problem
cites work: Solution of a Large-Scale Traveling-Salesman Problem
cites work: Q3182199
cites work: A note on the separation of subtour elimination constraints in elementary shortest path problems
cites work: Solving elementary shortest-path problems as mixed-integer programs
cites work: An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
cites work: Solving the Orienteering Problem through Branch-and-Cut
cites work: Finding Paths and Cycles of Superpolylogarithmic Length
cites work: Q4540081
cites work: A new approach to the maximum-flow problem
cites work: Enhanced compact models for the connected subgraph problem and for the shortest path problem in digraphs with negative cycles
cites work: A strong flow-based formulation for the shortest path problem in digraphs with negative cycles
cites work: Shortest Path Problems with Resource Constraints
cites work: Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
cites work: A branch-and-cut algorithm for the capacitated profitable tour problem
cites work: On approximating the longest path in a graph
cites work: Integer Programming Formulation of Traveling Salesman Problems
cites work: Q4532225
cites work: An analytical comparison of different formulations of the travelling salesman problem
cites work: Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
cites work: A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
cites work: Depth-First Search and Linear Graph Algorithms
cites work: The orienteering problem: a survey
DOI: 10.1016/J.EJOR.2016.01.003
description: scientific article; zbMATH DE number 6636203