A Lagrangean heuristic for the capacitated concave minimum cost network flow problem
From MaRDI portal
Publication:1341992
DOI10.1016/0377-2217(94)90126-0zbMath0812.90046OpenAlexW2083957197MaRDI 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 boundheuristiccapacitated concave minimum cost network flowLagrangean dualizationsubgradient search
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Related Items (9)
The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation ⋮ Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables ⋮ On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope ⋮ A continuous approach for the concave cost supply problem via DC programming and DCA ⋮ A decentralized coordination mechanism for integrated production-transportation-inventory problem in the supply chain using Lagrangian relaxation ⋮ Lagrangian relaxation for the multiple constrained robust shortest path problem ⋮ Probabilistic local search algorithms for concave cost transportation network problems ⋮ The concave cost supply problem. ⋮ Global and local search algorithms for concave cost transshipment problems
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
This page was built for publication: A Lagrangean heuristic for the capacitated concave minimum cost network flow problem
