On solving the Lagrangian dual of integer programs via an incremental approach

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

zbMATH Keywords

convex minimizationnonsmooth optimizationbundle methodsLagrangian relaxation

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Integer programming (90C10)

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

• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 3614502 (Why is no real title available?)
• scientific article; zbMATH DE number 1321699 (Why is no real title available?)
• scientific article; zbMATH DE number 477581 (Why is no real title available?)
• A Branch-and-Price Algorithm for the Generalized Assignment Problem
• A Multiplier Adjustment Method for the Generalized Assignment Problem
• A numerically stable dual method for solving strictly convex quadratic programs
• A path relinking approach with ejection chains for the generalized assignment problem
• A survey of algorithms for the generalized assignment problem
• An Incremental Method for Solving Convex Finite Min-Max Problems
• An ejection chain approach for the generalized assignment problem
• Incremental subgradient methods for nondifferentiable optimization
• Solving the generalized assignment problem: an optimizing and heuristic approach
• The Lagrangian Relaxation Method for Solving Integer Programming Problems

Cited in

(20)

• An application-oriented guide for designing Lagrangean dual ascent algorithms
• A proximal-projection partial bundle method for convex constrained minimax problems
• A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairs
• Lower and upper bounds for the spanning tree with minimum branch vertices
• Success guarantee of dual search in integer programming: \(p\)-th power Lagrangian method.
• Spectral projected subgradient with a momentum term for the Lagrangean dual approach
• Lagrangian relaxation for SVM feature selection
• A Lagrangean-based decomposition approach for the link constrained Steiner tree problem
• Truck synchronization at single door cross-docking terminals
• Minimizing Piecewise-Concave Functions Over Polyhedra
• scientific article; zbMATH DE number 4033489 (Why is no real title available?)
• Lagrangian relaxation of the generic materials and operations planning model
• Lagrangian dual ascent by generalized linear programming
• A method for convex minimization based on translated first-order approximations
• A partially inexact bundle method for convex semi-infinite minmax problems
• Essentials of numerical nonsmooth optimization
• A splitting bundle approach for non-smooth non-convex minimization
• Comment on A nonlinear Lagrangian dual for integer programming.
• Repulsive assignment problem
• Essentials of numerical nonsmooth optimization

Describes a project that uses

Uses Software

• OR-Library

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)