Global Optimality Conditions for Discrete and Nonconvex Optimization—With Applications to Lagrangian Heuristics and Column Generation

DOI10.1287/OPRE.1060.0292MaRDI QIDQ3391990zbMATH OpenOpenAlexFDO

Authors Torbjörn Larsson, Michael Patriksson

Publication date 13 August 2009

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.1060.0292

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Combinatorial optimization (90C27) Optimality conditions and duality in mathematical programming (90C46)

Recommendations

• scientific article; zbMATH DE number 1795208
• Lagrange duality and partitioning techniques in nonconvex global optimization
• Nonlinear Lagrangian theory for nonconvex optimization.
• The omnipresence of Lagrange
• A proximal extension of the column generation method to nonconvex conic optimization providing bounds for the duality gap

Cited in

(14)

• On the convergence of conditional -subgradient methods for convex programs and convex-concave saddle-point problems.
• A dissection of the duality gap of set covering problems
• Dissecting the duality gap: the supporting hyperplane interpretation revisited
• A theoretical justification of the set covering greedy heuristic of Caprara et al.
• An integer optimality condition for column generation on zero-one linear programs
• Convergent Lagrangian heuristics for nonlinear minimum cost network flows
• A horizon decomposition approach for the capacitated lot-sizing problem with setup times
• All-integer column generation for set partitioning: basic principles and extensions
• scientific article; zbMATH DE number 1795208 (Why is no real title available?)
• Ergodic, primal convergence in dual subgradient schemes for convex programming. II: The case of inconsistent primal problems
• An integer programming column generation principle for heuristic search methods
• Integer programming column generation: accelerating branch-and-price using a novel pricing scheme for finding high-quality solutions in set covering, packing, and partitioning problems
• A meta-heuristic extension of the Lagrangian heuristic framework
• Real-time vehicle rerouting problems with time windows

This page was built for publication: Global Optimality Conditions for Discrete and Nonconvex Optimization—With Applications to Lagrangian Heuristics and Column Generation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3391990)