A Lagrangean Relaxation Scheme for Structured Linear Programs With Application To Multicommodity Network Flows

DOI10.1080/02331939708844312zbMath0880.90101OpenAlexW1986624101MaRDI QIDQ4342969

Zhuangwei Liu, Torbjörn Larsson

Publication date: 5 February 1998

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

Lagrangean relaxationdual subgradient optimizationminimum cost multicommodity network flow

Mathematics Subject Classification ID

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

Related Items (11)

Integer equal flows ⋮ On the convergence of conditional \(\varepsilon\)-subgradient methods for convex programs and convex-concave saddle-point problems. ⋮ A dual scheme for traffic assignment problems ⋮ Convergent Lagrangian heuristics for nonlinear minimum cost network flows ⋮ Ergodic convergence in subgradient optimization ⋮ Dual subgradient method with averaging for optimal resource allocation ⋮ A Simple but Usually Fast Branch-and-Bound Algorithm for the Capacitated Facility Location Problem ⋮ Two ``well-known properties of subgradient optimization ⋮ A feasibility-ensured Lagrangian heuristic for general decomposable problems ⋮ An efficient lagrangean relaxation scheme for linear and integer equal flow problems ⋮ Primal convergence from dual subgradient methods for convex optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the choice of step size in subgradient optimization
• Decomposition Principle for Linear Programs
• The Decomposition Algorithm for Linear Programs
• Advanced start for the multicommodity network flow problem
• Coercion Functions and Decentralized Linear Programming
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Iterative Solution of Linear Programs
• Using Lagrangean Techniques to Solve Hierarchical Production Planning Problems
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• An Effective Subgradient Procedure for Minimal Cost Multicommodity Flow Problems
• A Survey of Linear Cost Multicommodity Network Flows
• A Price Schedules Decomposition Algorithm for Linear Programming Problems
• Validation of subgradient optimization
• Two-Level Planning
• Minimization of unsmooth functionals
• Multicommodity networks with resource constraints: The generalized multicommodity flow problem
• A partitioning algorithm for the multicommodity network flow problem

This page was built for publication: A Lagrangean Relaxation Scheme for Structured Linear Programs With Application To Multicommodity Network Flows