Minimum cost flows with minimum quantities (Q1944944): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network Flow Optimization with Minimum Quantities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal-cost network flow problems with variable lower bounds on arc flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the flow cost lowering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Recognition of Series Parallel Digraphs / rank
 
Normal rank

Revision as of 07:27, 6 July 2024

scientific article
Language Label Description Also known as
English
Minimum cost flows with minimum quantities
scientific article

    Statements

    Minimum cost flows with minimum quantities (English)
    0 references
    0 references
    0 references
    28 March 2013
    0 references
    minimum cost flow
    0 references
    computational complexity
    0 references
    approximation scheme
    0 references

    Identifiers