Disjunctive Programming
From MaRDI portal
Publication:3565239
DOI10.1007/978-3-540-68279-0_10zbMATH Open1187.90005OpenAlexW4234058490MaRDI QIDQ3565239FDOQ3565239
Authors: E. 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
Recommendations
- Disjunctive programming
- scientific article; zbMATH DE number 1873242
- Publication:4940934
- Disjunctive logic and semantics of disjunctive logic programs
- scientific article; zbMATH DE number 1267566
- An algorithm for disjunctive programs
- Disjunctive Programs with Set Constraints
- Publication:4493030
- scientific article; zbMATH DE number 1292288
- scientific article; zbMATH DE number 88998
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)
Cited In (10)
- Global optimization of disjunctive programs
- Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Disjunctive Programs with Set Constraints
- Constraint qualification failure in action
- A strong duality theorem for the minimum of a family of convex programs
- Structured learning modulo theories
- A branch and cut algorithm for minimum spanning trees under conflict constraints
- No Efficient Disjunction or Conjunction of Switch-Lists
This page was built for publication: Disjunctive Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3565239)
