A Lagrangean Relaxation Scheme for Structured Linear Programs With Application To Multicommodity Network Flows
From MaRDI portal
(Redirected from Publication:4342969)
Recommendations
- Approximate subgradient methods for Lagrangian relaxations on networks
- Lagrangian relaxations on networks by \(\varepsilon \)-subgradient methods
- Lagrangian Relaxation via Ballstep Subgradient Methods
- A parametric programming methodology to solve the Lagrangian dual for network problems with multiple side-constraints
- An efficient lagrangean relaxation scheme for linear and integer equal flow problems
Cites work
- A partitioning algorithm for the multicommodity network flow problem
- A Price Schedules Decomposition Algorithm for Linear Programming Problems
- A Survey of Linear Cost Multicommodity Network Flows
- Advanced start for the multicommodity network flow problem
- An Effective Subgradient Procedure for Minimal Cost Multicommodity Flow Problems
- Coercion Functions and Decentralized Linear Programming
- Decomposition Principle for Linear Programs
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- scientific article; zbMATH DE number 3819432 (Why is no real title available?)
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- scientific article; zbMATH DE number 3961334 (Why is no real title available?)
- scientific article; zbMATH DE number 3748742 (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?)
- scientific article; zbMATH DE number 3356467 (Why is no real title available?)
- Iterative Solution of Linear Programs
- Minimization of unsmooth functionals
- Multicommodity networks with resource constraints: The generalized multicommodity flow problem
- On the choice of step size in subgradient optimization
- The Decomposition Algorithm for Linear Programs
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Two-Level Planning
- Using Lagrangean Techniques to Solve Hierarchical Production Planning Problems
- Validation of subgradient optimization
Cited in
(26)- Two ``well-known properties of subgradient optimization
- An augmented Lagrangian approach to multi-commodity flow problems with conversions
- A technique for speeding up the solution of the Lagrangean dual
- LP relaxations better than convexification for multicommodity network optimization problems with step increasing cost functions
- On the convergence of conditional -subgradient methods for convex programs and convex-concave saddle-point problems.
- An augmented Lagrangian algorithm for large scale multicommodity routing
- Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design
- A feasibility-ensured Lagrangian heuristic for general decomposable problems
- Primal convergence from dual subgradient methods for convex optimization
- A parametric programming methodology to solve the Lagrangian dual for network problems with multiple side-constraints
- A Lagrangean relaxation approach for the mixed-model flow line sequencing problem
- Convergent Lagrangian heuristics for nonlinear minimum cost network flows
- The Lagrangian search method
- A simple but usually fast branch-and-bound algorithm for the capacitated facility location problem
- Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints
- scientific article; zbMATH DE number 446518 (Why is no real title available?)
- Relaxation methods for the strictly convex multicommodity flow problem with capacity constraints on individual commodities
- Solving Large-Scale Linear Multicommodity Flow Problems with an Active Set Strategy and Proximal-ACCPM
- On the Effectiveness of the Linear Programming Relaxation of the 0-1 Multi-commodity Minimum Cost Network Flow Problem
- An efficient lagrangean relaxation scheme for linear and integer equal flow problems
- A dual scheme for traffic assignment problems
- Ergodic convergence in subgradient optimization
- scientific article; zbMATH DE number 7071840 (Why is no real title available?)
- Lagrangian Relaxation via Ballstep Subgradient Methods
- Dual subgradient method with averaging for optimal resource allocation
- Integer equal flows
This page was built for publication: A Lagrangean Relaxation Scheme for Structured Linear Programs With Application To Multicommodity Network Flows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4342969)
