An algorithm for a concave production cost network flow problem
From MaRDI portal
Publication:1301576
DOI10.1007/BF03167328zbMath0937.90009MaRDI QIDQ1301576
Hiroshi Konno, Yasutoshi Yajima
Publication date: 14 June 2000
Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- On finding new vertices and redundant constraints in cutting plane algorithms for global optimization
- An algorithm for the min concave cost flow problem
- Handbook of global optimization
- The minimum concave cost network flow problem with fixed numbers of sources and nonlinear arc costs
- Send-and-Split Method for Minimum-Concave-Cost Network Flows
- A composite algorithm for a concave-cost network flow problem
- A New Optimization Method for Large Scale Fixed Charge Transportation Problems
- Capacitated Warehouse Location with Concave Costs
- Approximate solutions of capacitated fixed-charge minimum cost network flow problems
- A LAGRANGEAN APPROACH TO THE FACILITY LOCATION PROBLEM WITH CONCAVE COSTS
- A New Branch-and-Bound Algorithm for the Fixed-Charge Transportation Problem
- An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem
- Optimal Facility Location with Concave Costs
- The Group-Theoretic Structure in the Fixed-Charge Transportation Problem
- Technical Note—Exact Solution of the Fixed-Charge Transportation Problem
- An Efficient Branch and Bound Algorithm for the Warehouse Location Problem