A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems
From MaRDI portal
Publication:2503087
DOI10.1016/j.ejor.2005.03.024zbMath1102.90011OpenAlexW2008401418MaRDI QIDQ2503087
Eleni Hadjiconstantinou, Nicos Christofides, Dalila B. M. M. Fontes
Publication date: 13 September 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.03.024
global optimizationdynamic programmingcombinatorial optimizationnetwork flowsconcave-cost optimization
Nonconvex programming, global optimization (90C26) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Dynamic programming (90C39)
Related Items
Bilinear modeling solution approach for fixed charge network flow problems, A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks, Optimal Hop-Constrained Trees for Nonlinear Cost Flow Networks, A deterministic annealing algorithm for the minimum concave cost network flow problem, A nonlinear multiobjective bilevel model for minimum cost network flow problem in a large-scale construction project, Lower bounds from state space relaxations for concave cost network flow problems, A branch-and-bound algorithm for concave network flow problems, Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints, On the Computational Complexity of Minimum-Concave-Cost Flow in a Two-Dimensional Grid
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some branch and bound techniques for nonlinear optimization
- Enumerative techniques for solving some nonconvex global optimization problems
- An algorithm for the min concave cost flow problem
- Global search algorithms for minimum concave-cost network flow problems
- Algorithms for the single-source uncapacitated minimum concave-cost network flow problem
- A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
- An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks
- Solving fixed-charge network flow problems with a hybrid optimization and constraint programming approach
- Nonconvex optimization over a polytope using generalized capacity improvement
- \(bc\)-\(opt\): A branch-and-cut code for mixed integer programs
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms
- Lower bounds from state space relaxations for concave cost network flow problems
- A branch-and-bound algorithm for concave network flow problems
- On a Class of Capacitated Transportation Problems
- On the use of lexicographic min cost flows in evacuation modeling
- Send-and-Split Method for Minimum-Concave-Cost Network Flows
- Analysis of a flow problem with fixed charges
- Optimal Facility Location with Concave Costs
- Upper bounds for single-source uncapacitated concave minimum-cost network flow problems
- Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems
- A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
- Minimum Concave Cost Flows in Certain Networks
- Another Proof of Cayley's Formula for Counting Trees
- A dynamic domain contraction algorithm for nonconvex piecewise linear network flow problems
- Linear approximations in a dynamic programming approach for the uncapacitated single-source minimum concave cost network flow problem in acyclic networks.
