On solving the Lagrangian dual of integer programs via an incremental approach
From MaRDI portal
Publication:849073
DOI10.1007/S10589-007-9149-2zbMATH Open1184.90109OpenAlexW1985752510MaRDI QIDQ849073FDOQ849073
Authors: Manlio Gaudioso, Giovanni Giallombardo, Giovanna Miglionico 
Publication date: 24 February 2010
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-007-9149-2
Recommendations
- About Lagrangian methods in integer optimization
- An application-oriented guide for designing Lagrangean dual ascent algorithms
- A Lagrangean dual-based solution method for a special linear programming problem
- A new Lagrangian relaxation approach to the generalized assignment problem
- Improved Lagrangean decomposition: An application to the generalized assignment problem
Cites Work
- A numerically stable dual method for solving strictly convex quadratic programs
- A survey of algorithms for the generalized assignment problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Title not available (Why is that?)
- Incremental subgradient methods for nondifferentiable optimization
- An Incremental Method for Solving Convex Finite Min-Max Problems
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
- A Multiplier Adjustment Method for the Generalized Assignment Problem
- An ejection chain approach for the generalized assignment problem
- A path relinking approach with ejection chains for the generalized assignment problem
- Solving the generalized assignment problem: an optimizing and heuristic approach
Cited In (20)
- Repulsive assignment problem
- Title not available (Why is that?)
- A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairs
- Success guarantee of dual search in integer programming: \(p\)-th power Lagrangian method.
- Minimizing Piecewise-Concave Functions Over Polyhedra
- An application-oriented guide for designing Lagrangean dual ascent algorithms
- Comment on A nonlinear Lagrangian dual for integer programming.
- Essentials of numerical nonsmooth optimization
- Lagrangian dual ascent by generalized linear programming
- A partially inexact bundle method for convex semi-infinite minmax problems
- A proximal-projection partial bundle method for convex constrained minimax problems
- Spectral projected subgradient with a momentum term for the Lagrangean dual approach
- Lower and upper bounds for the spanning tree with minimum branch vertices
- Lagrangian relaxation for SVM feature selection
- Truck synchronization at single door cross-docking terminals
- Lagrangian relaxation of the generic materials and operations planning model
- A method for convex minimization based on translated first-order approximations
- A splitting bundle approach for non-smooth non-convex minimization
- A Lagrangean-based decomposition approach for the link constrained Steiner tree problem
- Essentials of numerical nonsmooth optimization
Uses Software
This page was built for publication: On solving the Lagrangian dual of integer programs via an incremental approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q849073)
