Disjunctive programming

DOI10.1007/978-3-030-00148-3MaRDI QIDQ4686608zbMATH OpenOpenAlexFDO

Authors E. Balas

Publication date 2 October 2018

Full work available at URL https://doi.org/10.1007/978-3-030-00148-3

zbMATH Keywords

nonconvex programminginteger programmingdisjunctive programmingdisjunctive sets

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Mixed integer programming (90C11)

Recommendations

• Disjunctive programming: Properties of the convex hull of feasible points
• Lift-and-project for mixed 0-1 programming: recent progress
• Disjunctive cuts for mixed integer nonlinear programming problems
• scientific article; zbMATH DE number 1873242
• Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems

Cited in

(29)

• Constrained composite optimization and augmented Lagrangian methods
• scientific article; zbMATH DE number 1420797 (Why is no real title available?)
• An outer-approximation algorithm for maximum-entropy sampling
• Disjunctive Programming
• On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs
• scientific article; zbMATH DE number 913208 (Why is no real title available?)
• Job scheduling under time-of-use energy tariffs for sustainable manufacturing: a survey
• Between steps: intermediate relaxations between big-M and convex hull formulations
• Polyhedral results and branch-and-cut for the resource loading problem
• Convex mixed-integer nonlinear programs derived from generalized disjunctive programming using cones
• Two-halfspace closure
• Facet separation for disjunctive constraints with network flow representation
• A comparison of solution approaches for the numerical treatment of or-constrained optimization problems
• Pyomo.GDP: an ecosystem for logic based modeling and optimization development
• A linear programming approach to approximating the infinite time reachable set of strictly stable linear control systems
• No Efficient Disjunction or Conjunction of Switch-Lists
• Assembly planning by disjunctive programming and geometrical reasoning
• scientific article; zbMATH DE number 1267566 (Why is no real title available?)
• scientific article; zbMATH DE number 3852794 (Why is no real title available?)
• Disjunctive Programs with Set Constraints
• An outer-approximation algorithm for maximum-entropy sampling
• scientific article; zbMATH DE number 1873242 (Why is no real title available?)
• Solving problems with min-type functions by disjunctive programming
• Decomposition of loosely coupled integer programs: a multiobjective perspective
• A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming
• Convexification of Permutation-Invariant Sets and an Application to Sparse Principal Component Analysis
• Data-driven project portfolio selection: decision-dependent stochastic programming formulations with reliability and time to market requirements
• Ideal, non-extended formulations for disjunctive constraints admitting a network representation
• SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs

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 Q4686608)