A branch-and-bound algorithm for concave network flow problems (Q2494473): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: OR-Library / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10898-005-1658-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2045731584 / 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: State-space relaxation procedures for the computation of bounds to routing problems / 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: Upper bounds for single-source uncapacitated concave minimum-cost network flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic programming approach for solving single-source uncapacitated concave minimum cost 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: Global search algorithms for minimum concave-cost network flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Validation of subgradient optimization / 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: 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: A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Concave Cost Flows in Certain Networks / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:30, 24 June 2024

scientific article
Language Label Description Also known as
English
A branch-and-bound algorithm for concave network flow problems
scientific article

    Statements

    A branch-and-bound algorithm for concave network flow problems (English)
    0 references
    28 June 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Branch-and-bound
    0 references
    concave network flows
    0 references
    dynamic programming
    0 references
    global optimization
    0 references
    state space relaxation
    0 references
    0 references