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

DOI10.1287/opre.1060.0292zbMath1167.90633OpenAlexW1966841850MaRDI QIDQ3391990

Michael Patriksson, Torbjörn Larsson

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) Optimality conditions and duality in mathematical programming (90C46) Combinatorial optimization (90C27)

Related Items (11)

Dissecting the duality gap: the supporting hyperplane interpretation revisited ⋮ All-integer column generation for set partitioning: basic principles and extensions ⋮ 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 ⋮ 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 ⋮ On the convergence of conditional \(\varepsilon\)-subgradient methods for convex programs and convex-concave saddle-point problems. ⋮ Real-time vehicle rerouting problems with time windows ⋮ Ergodic, primal convergence in dual subgradient schemes for convex programming. II: The case of inconsistent primal problems ⋮ Convergent Lagrangian heuristics for nonlinear minimum cost network flows ⋮ A Horizon Decomposition Approach for the Capacitated Lot-Sizing Problem with Setup Times

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