An algorithm for the min concave cost flow problem (Q1142707): 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/0377-2217(80)90109-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1996431511 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4083324 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacent extreme flows and application to min concave cost flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Facility Location with Concave Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cost routing for static network models / rank
 
Normal rank
Property / cites work
 
Property / cites work: On building minimum cost communication networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On building minimum cost communication networks over time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Concave Cost Flows in Certain Networks / rank
 
Normal rank

Latest revision as of 04:43, 13 June 2024

scientific article
Language Label Description Also known as
English
An algorithm for the min concave cost flow problem
scientific article

    Statements

    An algorithm for the min concave cost flow problem (English)
    0 references
    0 references
    0 references
    0 references
    1980
    0 references
    min concave cost flow problem
    0 references
    network flow problems
    0 references
    concave costs
    0 references
    global optimum
    0 references
    branch and bound procedure
    0 references
    linear relaxations
    0 references
    lower bounds
    0 references
    one source-multiple destination problem
    0 references

    Identifiers