A Lagrangean heuristic for the capacitated concave minimum cost network flow problem
From MaRDI portal
Publication:1341992
DOI10.1016/0377-2217(94)90126-0zbMath0812.90046MaRDI QIDQ1341992
Torbjörn Larsson, Mikael Rönnqvist, Athanasios Migdalas
Publication date: 11 January 1995
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(94)90126-0
lower bound; heuristic; capacitated concave minimum cost network flow; Lagrangean dualization; subgradient search
90C35: Programming involving graphs or networks
90B10: Deterministic network models in operations research
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new Lagrangian relaxation approach to the generalized assignment problem
- An algorithm for the min concave cost flow problem
- Concave cost minimization on networks
- Methods for Global Concave Minimization: A Bibliographic Survey
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- Networks synthesis and optimum network design problems: Models, solution methods and applications
- Send-and-Split Method for Minimum-Concave-Cost Network Flows
- Adjacent extreme flows and application to min concave cost flow problems
- Generalized Linear Programming Solves the Dual
- Using shortest paths in some transshipment problems with concave costs
- On building minimum cost communication networks
- Optimal Facility Location with Concave Costs
- Validation of subgradient optimization
- The Convex Simplex Method
- Minimum Concave Cost Flows in Certain Networks
- Minimum cost routing for static network models
- An Implicit Enumeration Algorithm for the Concave Cost Network Flow Problem
- Solving the Fixed Charge Problem by Ranking the Extreme Points
