An efficient lagrangean relaxation scheme for linear and integer equal flow problems

DOI10.1080/02331939808844399zbMath0912.90127OpenAlexW1971980172MaRDI QIDQ4224668

Zhuangwei Liu, Torbjörn Larsson

Publication date: 3 May 1999

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939808844399

zbMATH Keywords

heuristic algorithmsubgradient optimizationside constraintsminimal cost network flowLagrangean dualizationequal flow problemLagrangean heuristic methods

Mathematics Subject Classification ID

Linear programming (90C05) Deterministic network models in operations research (90B10)

Related Items

Integrality in the multinetwork min‐cost equal‐flow problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The equal flow problem
• Partitioning procedures for solving mixed-variables programming problems
• A Lagrangean Relaxation Algorithm for the Two Duty Period Scheduling Problem
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Using Lagrangean Techniques to Solve Hierarchical Production Planning Problems
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• A Lagrangean Relaxation Scheme for Structured Linear Programs With Application To Multicommodity Network Flows
• A Reduced Gradient Algorithm for Nonlinear Network Problems
• Validation of subgradient optimization
• Minimization of unsmooth functionals

This page was built for publication: An efficient lagrangean relaxation scheme for linear and integer equal flow problems