Disjunctive programming
From MaRDI portal
Publication:4686608
DOI10.1007/978-3-030-00148-3zbMATH Open1414.90001OpenAlexW4235585108MaRDI QIDQ4686608FDOQ4686608
Authors: E. Balas 
Publication date: 2 October 2018
Full work available at URL: https://doi.org/10.1007/978-3-030-00148-3
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
Nonconvex programming, global optimization (90C26) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Mixed integer programming (90C11)
Cited In (29)
- A comparison of solution approaches for the numerical treatment of or-constrained optimization problems
- Decomposition of loosely coupled integer programs: a multiobjective perspective
- Convexification of Permutation-Invariant Sets and an Application to Sparse Principal Component Analysis
- Title not available (Why is that?)
- Between steps: intermediate relaxations between big-M and convex hull formulations
- Title not available (Why is that?)
- On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs
- Title not available (Why is that?)
- Disjunctive Programs with Set Constraints
- Pyomo.GDP: an ecosystem for logic based modeling and optimization development
- Polyhedral results and branch-and-cut for the resource loading problem
- 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
- Disjunctive Programming
- Title not available (Why is that?)
- Assembly planning by disjunctive programming and geometrical reasoning
- SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs
- An outer-approximation algorithm for maximum-entropy sampling
- An outer-approximation algorithm for maximum-entropy sampling
- Job scheduling under time-of-use energy tariffs for sustainable manufacturing: a survey
- Facet separation for disjunctive constraints with network flow representation
- Title not available (Why is that?)
- Solving problems with min-type functions by disjunctive programming
- A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming
- Convex mixed-integer nonlinear programs derived from generalized disjunctive programming using cones
- Two-halfspace closure
- 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
- Constrained composite optimization and augmented Lagrangian methods
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)
