An introduction to dynamic generative networks: minimum cost flow (Q651703): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.apm.2011.04.009 / rank
Normal rank
 
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.1016/j.apm.2011.04.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2080853301 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5514188 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient continuous-time dynamic network flow algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Network Flow Problem with Uncertain arc Capacities: Formulation and Problem Structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universally maximum flow with piecewise-constant capacities / 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: The Quickest Transshipment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of dynamic network flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Flows in Dynamic Networks and Algorithms for their Finding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum flow problem on dynamic generative network flows with time-varying bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing Maximal Dynamic Flows from Static Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998396 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Decomposition Algorithm for Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition Principle for Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Multicommodity Network-Flow Problem with Side Constraints on Paths Solved by Column Generation / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.APM.2011.04.009 / rank
 
Normal rank

Latest revision as of 23:53, 9 December 2024

scientific article
Language Label Description Also known as
English
An introduction to dynamic generative networks: minimum cost flow
scientific article

    Statements

    An introduction to dynamic generative networks: minimum cost flow (English)
    0 references
    0 references
    18 December 2011
    0 references
    optimization
    0 references
    network/graphs
    0 references
    linear programming
    0 references
    decomposition methods
    0 references

    Identifiers