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

DOI10.1007/s10589-007-9149-2zbMath1184.90109OpenAlexW1985752510MaRDI QIDQ849073

Giovanni Giallombardo, Giovanna Miglionico, Manlio Gaudioso

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

nonsmooth optimizationLagrangian relaxationconvex minimizationbundle methods

Mathematics Subject Classification ID

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

Related Items

Lagrangian relaxation for SVM feature selection ⋮ Truck synchronization at single door cross-docking terminals ⋮ Lower and upper bounds for the spanning tree with minimum branch vertices ⋮ A method for convex minimization based on translated first-order approximations ⋮ A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairs ⋮ A partially inexact bundle method for convex semi-infinite minmax problems ⋮ A Lagrangean-based decomposition approach for the link constrained Steiner tree problem ⋮ Repulsive assignment problem ⋮ Essentials of numerical nonsmooth optimization ⋮ Minimizing Piecewise-Concave Functions Over Polyhedra ⋮ Lagrangian relaxation of the generic materials and operations planning model ⋮ A proximal-projection partial bundle method for convex constrained minimax problems ⋮ A splitting bundle approach for non-smooth non-convex minimization ⋮ Essentials of numerical nonsmooth optimization

Uses Software

• OR-Library

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A numerically stable dual method for solving strictly convex quadratic programs
• A survey of algorithms for the generalized assignment problem
• A path relinking approach with ejection chains for the generalized assignment problem
• Incremental Subgradient Methods for Nondifferentiable Optimization
• Solving the Generalized Assignment Problem: An Optimizing and Heuristic Approach
• An Ejection Chain Approach for the Generalized Assignment Problem
• A Multiplier Adjustment Method for the Generalized Assignment Problem
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• A Branch-and-Price Algorithm for the Generalized Assignment Problem
• An Incremental Method for Solving Convex Finite Min-Max Problems