Modular circulation and applications to traffic management (Q5919619): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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/s00453-018-0491-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2886508947 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of an Unregulated Traffic Crossing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching, Euler tours and the Chinese postman / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding minimum-cost circulations by canceling negative cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Formulae and Their Uses / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial time primal network simplex algorithm for minimum cost flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Autonomous Vehicle Platoons Through an Unregulated Intersection / rank
 
Normal rank

Latest revision as of 09:36, 20 July 2024

scientific article; zbMATH DE number 7103282
Language Label Description Also known as
English
Modular circulation and applications to traffic management
scientific article; zbMATH DE number 7103282

    Statements

    Modular circulation and applications to traffic management (English)
    0 references
    0 references
    0 references
    0 references
    10 September 2019
    0 references
    network flows
    0 references
    circulations
    0 references
    traffic management
    0 references
    approximation algorithms
    0 references
    NP-hard problems
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references