Algorithms for the single-source uncapacitated minimum concave-cost network flow problem (Q1200636): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3844775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximative algorithm for the fixed charge problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3258669 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Send-and-Split Method for Minimum-Concave-Cost Network Flows / 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: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum concave-cost network flow problems: Applications, complexity, and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3042874 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained global optimization: algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Checking local optimality in constrained quadratic programming is NP- hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: The fixed charge problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Heuristic Adjacent Extreme Point Algorithm for the Fixed Charge Problem / 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: A Deterministic Multi-Period Production Scheduling Model with Backlogging / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Concave Cost Flows in Certain Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach / rank
 
Normal rank

Latest revision as of 12:02, 17 May 2024

scientific article
Language Label Description Also known as
English
Algorithms for the single-source uncapacitated minimum concave-cost network flow problem
scientific article

    Statements

    Algorithms for the single-source uncapacitated minimum concave-cost network flow problem (English)
    0 references
    0 references
    0 references
    0 references
    16 January 1993
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    global optimization
    0 references
    NP-hard
    0 references
    single-source uncapacitated network flow
    0 references
    minimum concave-cost network flow
    0 references
    local search
    0 references