Network Flow Optimization with Minimum Quantities (Q5232831): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Negative-cycle detection algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-bound algorithm for concave 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: Complexity and algorithms for nonlinear optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faster Strongly Polynomial Minimum Cost Flow Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Class of Capacitated Transportation Problems / rank
 
Normal rank

Latest revision as of 11:20, 20 July 2024

scientific article; zbMATH DE number 7104796
Language Label Description Also known as
English
Network Flow Optimization with Minimum Quantities
scientific article; zbMATH DE number 7104796

    Statements

    Identifiers