On the shortest path problem with negative cost cycles
From MaRDI portal
Publication:5963684
DOI10.1007/s10589-015-9773-1zbMath1339.90323OpenAlexW910730312WikidataQ58920992 ScholiaQ58920992MaRDI QIDQ5963684
Francesca Guerriero, Luigi Di Puglia Pugliese
Publication date: 23 February 2016
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-015-9773-1
Related Items (3)
Two-phase algorithm for solving the preference-based multicriteria optimal path problem with reference points ⋮ MTZ-primal-dual model, cutting-plane, and combinatorial branch-and-bound for shortest paths avoiding negative cycles ⋮ Valid inequalities and lifting procedures for the shortest path problem in digraphs with negative cycles
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- On the number of cycles possible in digraphs with large girth
- The asymmetric m-travelling salesman problem: A duality based branch-and- bound algorithm
- Finding all the negative cycles in a directed graph
- Separating capacity constraints in the CVRP using tabu search
- Shortest paths algorithms: Theory and experimental evaluation
- A computational study of solution approaches for the resource constrained elementary shortest path problem
- Solving elementary shortest-path problems as mixed-integer programs
- A zero-space algorithm for negative cost cycle detection in networks
- Resource extension functions: properties, inversion, and generalization to segments
- Shortest path problem with forbidden paths: the elementary version
- Accelerated label setting algorithms for the elementary resource constrained shortest path problem
- On the Shortest Route Through a Network
- A survey of resource constrained shortest path problems: Exact solution approaches
- Multi-dimensional labelling approaches to solve the linear fractional elementary shortest path problem with time windows
- A strong flow-based formulation for the shortest path problem in digraphs with negative cycles
- On a routing problem
- Faster algorithms for the shortest path problem
- New dynamic programming algorithms for the resource constrained elementary shortest path problem
- A Class of Label-Correcting Methods for the K Shortest Paths Problem
- An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems
- An algorithm for the resource constrained shortest path problem
- Technical Note—A Note on the Multiple Traveling Salesmen Problem
- A comparison of three algorithms for finding fundamental cycles in a directed graph
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
- On the Average Number of Maxima in a Set of Vectors and Applications
- Parallel iterative search methods for vehicle routing problems
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
- On the Distribution of the Number of Admissible Points in a Vector Random Sample
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- Faster Scaling Algorithms for Network Problems
- Fibonacci heaps and their uses in improved network optimization algorithms
- DEVIATION ALGORITHMS FOR RANKING SHORTEST PATHS
- An Appraisal of Some Shortest-Path Algorithms
- Finding the K Shortest Loopless Paths in a Network
This page was built for publication: On the shortest path problem with negative cost cycles
