Convergent Lagrangian heuristics for nonlinear minimum cost network flows

DOI10.1016/J.EJOR.2007.06.005MaRDI QIDQ2480971zbMATH OpenOpenAlexFDO

Authors Torbjörn Larsson, Johan Marklund, Caroline Olsson, Michael Patriksson

Publication date 7 April 2008

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://research.chalmers.se/en/publication/42503

zbMATH Keywords

network flowsconvex programminglarge-scale programming

Mathematics Subject Classification ID

Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Deterministic network models in operations research (90B10)

Recommendations

• A Lagrangean heuristic for the capacitated concave minimum cost network flow problem
• A Network-Based Primal-Dual Heuristic for the Solution of Multicommodity Network Flow Problems
• Lagrangian relaxations on networks by \(\varepsilon \)-subgradient methods
• Computational development of a lagrangian dual approach for quadratic networks
• A surrogate and Lagrangian approach to constrained network problems

Cites work

• scientific article; zbMATH DE number 3961334 (Why is no real title available?)
• scientific article; zbMATH DE number 51132 (Why is no real title available?)
• scientific article; zbMATH DE number 1239298 (Why is no real title available?)
• scientific article; zbMATH DE number 544186 (Why is no real title available?)
• scientific article; zbMATH DE number 1382772 (Why is no real title available?)
• scientific article; zbMATH DE number 3365044 (Why is no real title available?)
• A Lagrangean Relaxation Scheme for Structured Linear Programs With Application To Multicommodity Network Flows
• A polynomially bounded algorithm for a singly constrained quadratic program
• A survey on the continuous nonlinear resource allocation problem
• An O(n) algorithm for quadratic knapsack problems
• Computational development of a lagrangian dual approach for quadratic networks
• Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
• Global Optimality Conditions for Discrete and Nonconvex Optimization—With Applications to Lagrangian Heuristics and Column Generation
• Iterative Methods for Large Convex Quadratic Programs: A Survey
• Lagrangian dual coordinatewise maximization algorithm for network transportation problems with quadratic costs
• Monotone networks
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• Network flows. Theory, algorithms, and applications.
• On the Convergence Rate of Dual Ascent Methods for Linearly Constrained Convex Minimization
• On the convergence properties of the projected gradient method for convex optimization
• On the dual coordinate ascent approach for nonlinear networks
• Relaxation Methods for Network Flow Problems with Convex Arc Costs
• The Lagrangian Relaxation Method for Solving Integer Programming Problems

Cited in

(4)

• Resource-constrained management of heterogeneous assets with stochastic deterioration
• Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints
• A Lagrangean heuristic for the capacitated concave minimum cost network flow problem
• Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies

Describes a project that uses

Uses Software

• NETGEN

This page was built for publication: Convergent Lagrangian heuristics for nonlinear minimum cost network flows

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2480971)