On the shortest path problem with negative cost cycles

DOI10.1007/S10589-015-9773-1zbMATH Open1339.90323DBLPjournals/coap/PuglieseG16OpenAlexW910730312WikidataQ58920992 ScholiaQ58920992MaRDI QIDQ5963684FDOQ5963684

Cites Work

NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
A note on two problems in connexion with graphs
Title not available (Why is that?)
On a routing problem
Fibonacci heaps and their uses in improved network optimization algorithms
New dynamic programming algorithms for the resource constrained elementary shortest path problem
An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems
An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
A zero-space algorithm for negative cost cycle detection in networks
Faster Scaling Algorithms for Network Problems
Title not available (Why is that?)
On the Distribution of the Number of Admissible Points in a Vector Random Sample
A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
DEVIATION ALGORITHMS FOR RANKING SHORTEST PATHS
Finding the K Shortest Loopless Paths in a Network
Faster algorithms for the shortest path problem
An Appraisal of Some Shortest-Path Algorithms
A computational study of solution approaches for the resource constrained elementary shortest path problem
Resource extension functions: properties, inversion, and generalization to segments
Accelerated label setting algorithms for the elementary resource constrained shortest path problem
A survey of resource constrained shortest path problems: exact solution approaches
Title not available (Why is that?)
Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
Separating capacity constraints in the CVRP using tabu search
Parallel iterative search methods for vehicle routing problems
Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
Title not available (Why is that?)
Finding all the negative cycles in a directed graph
Solving elementary shortest-path problems as mixed-integer programs
Shortest path problem with forbidden paths: the elementary version
On the shortest route through a network
A strong flow-based formulation for the shortest path problem in digraphs with negative cycles
An algorithm for the resource constrained shortest path problem
Shortest paths algorithms: Theory and experimental evaluation
On the Average Number of Maxima in a Set of Vectors and Applications
Technical Note—A Note on the Multiple Traveling Salesmen Problem
Title not available (Why is that?)
A Class of Label-Correcting Methods for the K Shortest Paths Problem
On the number of cycles possible in digraphs with large girth
The asymmetric m-travelling salesman problem: A duality based branch-and- bound algorithm
A comparison of three algorithms for finding fundamental cycles in a directed graph
Multi-dimensional labelling approaches to solve the linear fractional elementary shortest path problem with time windows

Cited In (7)

Title not available (Why is that?)
Valid inequalities and lifting procedures for the shortest path problem in digraphs with negative cycles
Title not available (Why is that?)
On the complexity of algorithms for detecting \(k\)-length negative cost cycles
On a negative-equivalency theorem in associative optimal path problems
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

Uses Software

VRP
NETGEN
Algorithm 97

This page was built for publication: On the shortest path problem with negative cost cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963684)