On the shortest path problem with negative cost cycles (Q5963684): Difference between revisions

From MaRDI portal
Changed an Item
Created claim: DBLP publication ID (P1635): journals/coap/PuglieseG16, #quickstatements; #temporary_batch_1731547958265
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10589-015-9773-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W910730312 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster algorithms for the shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The asymmetric m-travelling salesman problem: A duality based branch-and- bound algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of cycles possible in digraphs with large girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating capacity constraints in the CVRP using tabu search / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Distribution of the Number of Admissible Points in a Vector Random Sample / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the resource constrained shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Average Number of Maxima in a Set of Vectors and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerated label setting algorithms for the elementary resource constrained shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of three algorithms for finding fundamental cycles in a directed graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest paths algorithms: Theory and experimental evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048611 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Shortest Route Through a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4857376 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational study of solution approaches for the resource constrained elementary shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest path problem with forbidden paths: the elementary version / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of resource constrained shortest path problems: Exact solution approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving elementary shortest-path problems as mixed-integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Appraisal of Some Shortest-Path Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3292914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fibonacci heaps and their uses in improved network optimization algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Scaling Algorithms for Network Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140424 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4955265 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Class of Label-Correcting Methods for the K Shortest Paths Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-dimensional labelling approaches to solve the linear fractional elementary shortest path problem with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strong flow-based formulation for the shortest path problem in digraphs with negative cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource extension functions: properties, inversion, and generalization to segments / rank
 
Normal rank
Property / cites work
 
Property / cites work: NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: DEVIATION ALGORITHMS FOR RANKING SHORTEST PATHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—A Note on the Multiple Traveling Salesmen Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: New dynamic programming algorithms for the resource constrained elementary shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A zero-space algorithm for negative cost cycle detection in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel iterative search methods for vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding all the negative cycles in a directed graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the <i>K</i> Shortest Loopless Paths in a Network / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/coap/PuglieseG16 / rank
 
Normal rank

Latest revision as of 03:22, 14 November 2024

scientific article; zbMATH DE number 6544372
Language Label Description Also known as
English
On the shortest path problem with negative cost cycles
scientific article; zbMATH DE number 6544372

    Statements

    On the shortest path problem with negative cost cycles (English)
    0 references
    23 February 2016
    0 references
    shortest paths
    0 references
    negative cost cycles
    0 references
    dynamic programming
    0 references
    \(k\) shortest paths
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers