A hierarchy of relaxations for linear generalized disjunctive programming
From MaRDI portal
Recommendations
- Generalized disjunctive programming: solution strategies
- Generalized disjunctive programming: a framework for formulation and alternative algorithms for MINLP optimization
- Generalized convex disjunctive programming: Nonlinear convex hull relaxation
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- A hierarchy of relaxations for nonlinear convex generalized disjunctive programming
Cites work
- scientific article; zbMATH DE number 3891096 (Why is no real title available?)
- scientific article; zbMATH DE number 3559278 (Why is no real title available?)
- scientific article; zbMATH DE number 1550909 (Why is no real title available?)
- A branch-and-cut method for 0-1 mixed convex programming
- Convex programming for disjunctive convex optimization
- Disjunctive Programming
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- Disjunctive programming: Properties of the convex hull of feasible points
- Exact algorithms for the guillotine strip cutting/packing problem.
- Facial disjunctive programs and sequences of cutting-planes
- Generalized convex disjunctive programming: Nonlinear convex hull relaxation
- Logic-based decision support. Mixed integer model formulation
- Modelling with integer variables
- Optimization with disjunctive constraints
- Representability in mixed integer programming. I: Characterization results
- Review of nonlinear mixed-integer and disjunctive programming techniques
- Sequential convexification in reverse convex and disjunctive programming
Cited in
(24)- \textsc{OptiMathSAT}: a tool for optimization modulo theories
- Generalized convex disjunctive programming: Nonlinear convex hull relaxation
- Convex mixed-integer nonlinear programs derived from generalized disjunctive programming using cones
- A disjunctive model to analyze and redefine the logistic of replenishing goods of retailing stores
- Three algorithms for graph locally harmonious colouring
- Pyomo.GDP: an ecosystem for logic based modeling and optimization development
- Logic-based modeling and solution of nonlinear discrete/continuous optimization problems
- Generalized disjunctive programming: a framework for formulation and alternative algorithms for MINLP optimization
- Extensions to generalized disjunctive programming: hierarchical structures and first-order logic
- Finite Disjunctive Programming Characterizations for General Mixed-Integer Linear Programs
- Generalized disjunctive programming: solution strategies
- Optimization modulo theories with linear rational costs
- A hierarchy of relaxations for nonlinear convex generalized disjunctive programming
- Solving linear optimization over arithmetic constraint formula
- Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming
- Mixed integer linear programming formulation techniques
- Lagrangean relaxation of the hull-reformulation of linear generalized disjunctive programs and its use in disjunctive branch and bound
- Symmetry breaking for generalized disjunctive programming formulation of the strip packing problem
- Structured learning modulo theories
- Achieving MILP feasibility quickly using general disjunctions
- An interleaved depth-first search method for the linear optimization problem with disjunctive constraints
- Global optimization of disjunctive programs
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- Cutting plane algorithm for convex generalized disjunctive programs
This page was built for publication: A hierarchy of relaxations for linear generalized disjunctive programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q421708)
