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

DOI10.1080/02331939808844399MaRDI QIDQ4224668zbMATH OpenOpenAlexFDO

Authors Torbjörn Larsson, Zhuangwei Liu

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

subgradient optimizationheuristic algorithmside constraintsminimal cost network flowLagrangean dualizationequal flow problemLagrangean heuristic methods

Mathematics Subject Classification ID

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

Recommendations

• The equal flow problem
• A Lagrangean Relaxation Scheme for Structured Linear Programs With Application To Multicommodity Network Flows
• Network simplex algorithm for the general equal flow problem.
• Algorithms for the simple equal flow problem
• Lagrangian relaxations on networks by \(\varepsilon \)-subgradient methods

Cites work

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

Cited in

(3)

• The equal flow problem
• Integrality in the multinetwork min‐cost equal‐flow problem
• A Lagrangean relaxation approach for the mixed-model flow line sequencing problem

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

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