An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks

DOI10.1007/BF01545530zbMath0897.90096OpenAlexW1967180408MaRDI QIDQ1384224

Nguyen Van Thoai, Reiner Horst

Publication date: 13 April 1998

Published in: OR Spektrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01545530

zbMATH Keywords

branch-and-boundminimum cost network flow probleminteger concave minimization problemintegral rectangular partitionminimum concave cost capacitated network flow

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items

A new exact algorithm for concave knapsack problems with integer variables, Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables, A general purpose exact solution method for mixed integer concave minimization problems, Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method, Two level hierarchical time minimizing transportation problem, Lower bounds from state space relaxations for concave cost network flow problems, A branch-and-bound algorithm for concave network flow problems, A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems, Exact algorithm for concave knapsack problems: linear underestimation and partition method

Cites Work

• Unnamed Item
• Algorithms for the single-source uncapacitated minimum concave-cost network flow problem
• Decomposition approach for the global minimization of biconcave functions over polytopes
• A note on adapting methods for continuous global optimization to the discrete case
• Minimum concave-cost network flow problems: Applications, complexity, and algorithms
• Optimal Facility Location with Concave Costs
• A polynomial time solvable concave network flow problem
• An Algorithm for Separable Nonconvex Programming Problems