A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems (Q2503087): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4065051 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3241581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear approximations in a dynamic programming approach for the uncapacitated single-source minimum concave cost network flow problem in acyclic networks. / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(bc\)-\(opt\): A branch-and-cut code for mixed integer programs / 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: Upper bounds for single-source uncapacitated concave minimum-cost network flow problems / 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: Lower bounds from state space relaxations for concave cost network flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the min concave cost flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4833812 / 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: Algorithms for the single-source uncapacitated minimum concave-cost network flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global search algorithms for minimum concave-cost network flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the use of lexicographic min cost flows in evacuation modeling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of a flow problem with fixed charges / rank
 
Normal rank
Property / cites work
 
Property / cites work: An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4889854 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some branch and bound techniques for nonlinear optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic domain contraction algorithm for nonconvex piecewise linear network flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving fixed-charge network flow problems with a hybrid optimization and constraint programming approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonconvex optimization over a polytope using generalized capacity improvement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3042874 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Another Proof of Cayley's Formula for Counting Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerative techniques for solving some nonconvex global optimization 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: On a Class of Capacitated Transportation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Concave Cost Flows in Certain Networks / rank
 
Normal rank

Latest revision as of 20:18, 24 June 2024

scientific article
Language Label Description Also known as
English
A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems
scientific article

    Statements

    A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems (English)
    0 references
    13 September 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    network flows
    0 references
    dynamic programming
    0 references
    concave-cost optimization
    0 references
    global optimization
    0 references
    combinatorial optimization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references