The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths (Q741538): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2014.06.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2024965808 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Earliest Arrival Flows with Multiple Sources / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Algorithms for the Quickest Transshipment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quickest Flows Over Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3292914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Parametric Maximum Flow Algorithm and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to the maximum-flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal dynamic routing in communication networks with continuous traffic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicommodity flows over time: Efficient algorithms and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2776597 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Quickest Transshipment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note—Some Equivalent Objectives for Dynamic Network Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Minimum Weight In-Tree Cover Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(n \log^2 n)\) algorithm for the optimal sink location problem in dynamic tree networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A good algorithm for lexicographically optimal flows in multi-terminal networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal flows in networks with multiple sources and sinks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal, Lexicographic, and Dynamic Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank

Latest revision as of 01:41, 9 July 2024

scientific article
Language Label Description Also known as
English
The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths
scientific article

    Statements

    The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths (English)
    0 references
    0 references
    0 references
    12 September 2014
    0 references
    0 references
    dynamic network flow
    0 references
    universally quickest transshipment
    0 references
    uniform path-lengths
    0 references
    0 references