Solution method for nonconvex network flow problems

MaRDI QIDQ4363158zbMATH OpenFDO

Authors Gavin J. Bell, Bruce W. Lamar

Publication date 13 November 1997

zbMATH Keywords

capacity improvementconcave arc cost functionsconditional penaltiesminimum cost network flownonconvex network flow models

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Recommendations

• An improved branch and bound algorithm for minimum concave cost network flow problems
• A branch-and-bound algorithm for concave network flow problems
• Global search algorithms for minimum concave-cost network flow problems
• An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks

Cited in

(9)

• A method of network programming in problems of nonlinear optimization
• A decomposition method using a pricing mechanism for min concave cost flow problems with a hierarchical structure
• A heuristic for the continuous capacity and flow assignment
• Nonconvex optimization over a polytope using generalized capacity improvement
• A Newton method for convex separable network flow problems
• A hybrid algorithm for solving convex separable network flow problems
• scientific article; zbMATH DE number 1330764 (Why is no real title available?)
• An affine scaling method for solving network flow problems
• An improved branch and bound algorithm for minimum concave cost network flow problems

This page was built for publication: Solution method for nonconvex network flow problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4363158)