A modified subgradient algorithm for Lagrangean relaxation
From MaRDI portal
Publication:5926608
DOI10.1016/S0305-0548(99)00085-4zbMath1032.90033OpenAlexW2003814291MaRDI QIDQ5926608
Publication date: 13 May 2001
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(99)00085-4
Related Items (5)
A Lagrangian relaxation approach to the mixed-product assembly line sequencing problem: a case study of a door-lock company in Taiwan ⋮ Convergence and computational analyses for some variable target value and subgradient deflection methods ⋮ On the computational efficiency of subgradient methods: a case study with Lagrangian bounds ⋮ Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers ⋮ Embedding learning capability in Lagrangean relaxation: an application to the travelling salesman problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Two-direction subgradient method for non-differentiable optimization problems
- Convergence of a generalized subgradient method for nondifferentiable convex optimization
- A computational evaluation of two subgradient search methods
- On Poljak's improved subgradient method
- On the choice of step size in subgradient optimization
- Variable target value subgradient method
- A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
- Conditional subgradient optimization -- theory and applications
- Capacity analysis in repetitive assemble-to-order manufacturing systems
- Methods of descent for nondifferentiable optimization
- A generalization of Polyak's convergence result for subgradient optimization
- Polyak's subgradient method with simplified projection for nondifferentiable optimization with linear constraints
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- A Lagrangian Relaxation Technique for Optimizing Interconnection of Local Area Networks
- On convergence rates of subgradient optimization methods
- A Survey of Lagrangean Techniques for Discrete Optimization
- Validation of subgradient optimization
- Solution of a Large-Scale Traveling-Salesman Problem
- The Traveling-Salesman Problem and Minimum Spanning Trees
- Minimization of unsmooth functionals
- Convergence properties of the modified subgradient method of camerini et al
This page was built for publication: A modified subgradient algorithm for Lagrangean relaxation
