Disjunctive Programming

DOI10.1007/978-3-540-68279-0_10zbMath1187.90005OpenAlexW4234058490MaRDI QIDQ3565239

Egon Balas

Publication date: 3 June 2010

Published in: 50 Years of Integer Programming 1958-2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-68279-0_10

Mathematics Subject Classification ID

Convex programming (90C25) Boolean programming (90C09) Collected or selected works; reprintings or translations of classics (01A75) History of operations research and mathematical programming (90-03)

Related Items (6)

Global optimization of disjunctive programs ⋮ A strong duality theorem for the minimum of a family of convex programs ⋮ Constraint qualification failure in action ⋮ Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming ⋮ Structured learning modulo theories ⋮ A branch and cut algorithm for minimum spanning trees under conflict constraints

This page was built for publication: Disjunctive Programming