A zero-space algorithm for negative cost cycle detection in networks (Q2466006): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jda.2006.12.002 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of timed automata / 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: Temporal constraint networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474117 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scaling Algorithms for the Shortest Paths Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling real-time computations with separation constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3813613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472230 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3707420 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.JDA.2006.12.002 / rank
 
Normal rank

Latest revision as of 19:46, 18 December 2024

scientific article
Language Label Description Also known as
English
A zero-space algorithm for negative cost cycle detection in networks
scientific article

    Statements

    A zero-space algorithm for negative cost cycle detection in networks (English)
    0 references
    11 January 2008
    0 references
    negative cost cycles
    0 references
    polyhedra
    0 references
    difference constraints
    0 references
    stressing
    0 references
    relaxing
    0 references
    zero-space
    0 references
    shortest paths
    0 references

    Identifiers