A branch-and-bound algorithm for concave network flow problems
DOI10.1007/S10898-005-1658-XzbMATH Open1098.90080OpenAlexW2045731584MaRDI QIDQ2494473FDOQ2494473
Authors: Dalila B. M. M. Fontes, Eleni Hadjiconstantinou, Nicos Christofides 
Publication date: 28 June 2006
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-005-1658-x
Recommendations
- An improved branch and bound algorithm for minimum concave cost network flow problems
- scientific article; zbMATH DE number 1927152
- An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks
- Global search algorithms for minimum concave-cost network flow problems
- Lower bounds from state space relaxations for concave cost network flow problems
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10) Dynamic programming (90C39)
Cites Work
- Validation of subgradient optimization
- Analysis of a flow problem with fixed charges
- A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
- Minimum Concave Cost Flows in Certain Networks
- A dynamic domain contraction algorithm for nonconvex piecewise linear network flow problems
- State-space relaxation procedures for the computation of bounds to routing problems
- A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems
- 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
- Linear approximations in a dynamic programming approach for the uncapacitated single-source minimum concave cost network flow problem in acyclic networks.
- A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
- Solving fixed-charge network flow problems with a hybrid optimization and constraint programming approach
- Lower bounds from state space relaxations for concave cost network flow problems
- An algorithm for the min concave cost flow problem
- Global search algorithms for minimum concave-cost network flow problems
- \(bc\)-\(opt\): A branch-and-cut code for mixed integer programs
- An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks
Cited In (13)
- Title not available (Why is that?)
- A hybrid algorithm for solving convex separable network flow problems
- A conic quadratic formulation for a class of convex congestion functions in network flow problems
- A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems
- A specialized network simplex algorithm for the constrained maximum flow problem
- A bilinear relaxation based algorithm for concave piecewise linear network flow problems
- Network flow optimization with minimum quantities
- A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks
- A deterministic annealing algorithm for the minimum concave cost network flow problem
- An improved branch and bound algorithm for minimum concave cost network flow problems
- Bilinear modeling solution approach for fixed charge network flow problems
- On seeking efficient Pareto optimal points in multi-player minimum cost flow problems with application to transportation systems
- Lower bounds from state space relaxations for concave cost network flow problems
Uses Software
This page was built for publication: A branch-and-bound algorithm for concave network flow problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2494473)
