A Lagrangean heuristic for the capacitated concave minimum cost network flow problem
type: Item
instance of: scholarly article
title: A Lagrangean heuristic for the capacitated concave minimum cost network flow problem
zbMATH Open document ID: 0812.90046
DOI: 10.1016/0377-2217(94)90126-0
author: Torbjörn Larsson
author: Athanasios Migdalas
author: Mikael Rönnqvist
published in: European Journal of Operational Research
publication date: 1995-01-11T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 709899
zbMATH Keywords: heuristic
zbMATH Keywords: capacitated concave minimum cost network flow
zbMATH Keywords: Lagrangean dualization
zbMATH Keywords: subgradient search
zbMATH Keywords: lower bound
MaRDI profile type: Publication
full work available at URL: 0377-2217(94)90126-0
OpenAlex ID: W2083957197
cites work: Q3932576
cites work: Q4083324
cites work: Using shortest paths in some transshipment problems with concave costs
cites work: Send-and-Split Method for Minimum-Concave-Cost Network Flows
cites work: An Implicit Enumeration Algorithm for the Concave Cost Network Flow Problem
cites work: Q5627898
cites work: Adjacent extreme flows and application to min concave cost flow problems
cites work: Concave cost minimization on networks
cites work: An algorithm for the min concave cost flow problem
cites work: Lagrangean decomposition: A model yielding stronger lagrangean bounds
cites work: Validation of subgradient optimization
cites work: A new Lagrangian relaxation approach to the generalized assignment problem
cites work: Generalized Linear Programming Solves the Dual
cites work: Q3768657
cites work: Networks synthesis and optimum network design problems: Models, solution methods and applications
cites work: Solving the Fixed Charge Problem by Ranking the Extreme Points
cites work: Q4739657
cites work: Methods for Global Concave Minimization: A Bibliographic Survey
cites work: Q5187067
cites work: Optimal Facility Location with Concave Costs
cites work: Q5342287
cites work: Minimum cost routing for static network models
cites work: On building minimum cost communication networks
cites work: The Convex Simplex Method
cites work: Minimum Concave Cost Flows in Certain Networks
Recommended article: Heuristic solutions for general concave minimum cost network flow problems
Recommended article: Convergent Lagrangian heuristics for nonlinear minimum cost network flows
Recommended article: An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks
Recommended article: Q3840281
Recommended article: Lagrangian based heuristics for the multicommodity network flow problem with fixed costs on paths
Recommended article: Q4233338
Recommended article: Minimum concave-cost network flow problems: Applications, complexity, and algorithms
Recommended article: Q3626256
Recommended article: A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
Recommended article: Approximate solutions of capacitated fixed-charge minimum cost network flow problems
description: scientific article; zbMATH DE number 709899