An algorithm for disjunctive programs
From MaRDI portal
Recommendations
- Disjunctive programming: Properties of the convex hull of feasible points
- A finite cutting plane method for facial disjunctive programs
- Solving problems with min-type functions by disjunctive programming
- Disjunctive programming
- Review of nonlinear mixed-integer and disjunctive programming techniques
Cites work
- scientific article; zbMATH DE number 3891096 (Why is no real title available?)
- scientific article; zbMATH DE number 3713449 (Why is no real title available?)
- scientific article; zbMATH DE number 3497901 (Why is no real title available?)
- scientific article; zbMATH DE number 3438384 (Why is no real title available?)
- Correction to Disjunctive programming
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- Improved asymptotic analysis of the average number of steps performed by the self-dual simplex algorithm
- Integer Programming Algorithms: A Framework and State-of-the-Art Survey
- Modelling with integer variables
- Optimization with disjunctive constraints
- Technical Note—On Generating Cutting Planes from Combinatorial Disjunctions
Cited in
(31)- Decomposition and search techniques in disjunctive programs for portfolio selection
- Disjunctive Programming
- New classes of facets for complementarity knapsack problems
- Tight bounds for capacities
- Projection, lifting and extended formulation integer and combinatorial optimization
- An incremental algorithm for computing ranked full disjunctions
- Modelling either-or relations in integer programming
- Global optimization for max-plus linear systems and applications in distributed systems
- Pyomo.GDP: an ecosystem for logic based modeling and optimization development
- Logic-based modeling and solution of nonlinear discrete/continuous optimization problems
- Lift-and-project for mixed 0-1 programming: recent progress
- Mixed logical-linear programming
- No Efficient Disjunction or Conjunction of Switch-Lists
- New classes of facets for complementarity knapsack problems
- Constraint programming and operations research
- Optimizing invasive species management: a mixed-integer linear programming approach
- Solving disjunctive optimization problems by generalized semi-infinite optimization techniques
- Disjunctive Programs with Set Constraints
- A hierarchy of relaxations for nonlinear convex generalized disjunctive programming
- Stable classes and operator pairs for disjunctive programs
- Approximately global optimal control for max-plus linear systems and its application on load distribution
- Globally optimal solutions of max-min systems
- Mixed integer linear programming formulation techniques
- scientific article; zbMATH DE number 1873242 (Why is no real title available?)
- Lagrangean relaxation of the hull-reformulation of linear generalized disjunctive programs and its use in disjunctive branch and bound
- Solving problems with min-type functions by disjunctive programming
- scientific article; zbMATH DE number 3298488 (Why is no real title available?)
- An interleaved depth-first search method for the linear optimization problem with disjunctive constraints
- A unified approach to mixed-integer optimization problems with logical constraints
- Global optimization of disjunctive programs
- Mathematical programming formulations for piecewise polynomial functions
This page was built for publication: An algorithm for disjunctive programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1173796)
