Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
From MaRDI portal
Publication:3722274
Recommendations
- A hierarchy of relaxations for linear generalized disjunctive programming
- A hierarchy of relaxations for nonlinear convex generalized disjunctive programming
- Disjunctive programming and relaxations of polyhedra
- Disjunctive Programming for Multiobjective Discrete Optimisation
- Convex programming for disjunctive convex optimization
- Global optimization of disjunctive programs
- Discrete relaxations of combinatorial programs
- scientific article; zbMATH DE number 1114458
- Sparsity constrained optimization problems via disjunctive programming
- Disjunctive optimization, \(\max\)-separable problems and extremal algebras
Cites work
- Cutting planes from conditional bounds: A new approach to set covering
- Disjunctive Programming
- Facial disjunctive programs and sequences of cutting-planes
- scientific article; zbMATH DE number 3856823 (Why is no real title available?)
- scientific article; zbMATH DE number 3545380 (Why is no real title available?)
- scientific article; zbMATH DE number 3559278 (Why is no real title available?)
- scientific article; zbMATH DE number 3633982 (Why is no real title available?)
- scientific article; zbMATH DE number 3223353 (Why is no real title available?)
- Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
- Optimization with disjunctive constraints
- Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
- Strengthening cuts for mixed integer programs
- The perfectly matchable subgraph polytope of a bipartite graph
Cited in
(only showing first 100 items - show all)- A compact formulation of the ring loading problem with integer demand splitting
- A reformulation-linearization technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions
- On the convex hull of the union of certain polyhedra
- An algorithm for disjunctive programs
- Using separation algorithms to generate mixed integer model reformulations
- Two mixed integer programming formulations arising in manufacturing management
- A cutting-plane approach to mixed 0-1 stochastic integer programs
- Disjunctive programming: Properties of the convex hull of feasible points
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- A bound-improving approach to discrete programming problems
- A modified lift-and-project procedure
- Solving a large-scale industrial scheduling problem using MILP combined with a heuristic procedure
- Trajectory planning for autonomous underwater vehicles in the presence of obstacles and a nonlinear flow field using mixed integer nonlinear programming
- Computational approaches for mixed integer optimal control problems with indicator constraints
- Strong formulations for quadratic optimization with M-matrices and indicator variables
- Global optimization of MIQCPs with dynamic piecewise relaxations
- Solving linear optimization over arithmetic constraint formula
- Global optimization of disjunctive programs
- Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming
- Circuit and bond polytopes on series-parallel graphs
- A class of valid inequalities for multilinear 0-1 optimization problems
- A new lift-and-project operator
- A discrete optimization method based on a parameterization of a Grassmannian in multidimensional dichotomous data structuring
- Extended formulations for vertex cover
- Convex envelopes generated from finitely many compact convex sets
- An exact approach for solving integer problems under probabilistic constraints with random technology matrix
- Discrete and continuous-time formulations for dealing with break periods: preemptive and non-preemptive scheduling
- A finite \(\epsilon\)-convergence algorithm for two-stage stochastic convex nonlinear programs with mixed-binary first and second-stage variables
- Outer approximation for integer nonlinear programs via decision diagrams
- Separation routine and extended formulations for the stable set problem in claw-free graphs
- Convexification techniques for linear complementarity constraints
- Worst-case analysis of clique MIPs
- A decomposition method for distributionally-robust two-stage stochastic mixed-integer conic programs
- Between steps: intermediate relaxations between big-M and convex hull formulations
- Optimization of capacity expansion in potential-driven networks including multiple looping: a comparison of modelling approaches
- Comparison of mixed-integer relaxations with linear and logarithmic partitioning schemes for quadratically constrained problems
- Ideal, non-extended formulations for disjunctive constraints admitting a network representation
- A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function
- Mathematical programming formulations for piecewise polynomial functions
- Optimality-based bound contraction with multiparametric disaggregation for the global optimization of mixed-integer bilinear problems
- RLT insights into lift-and-project closures
- A generalization of extension complexity that captures P
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- On optimizing over lift-and-project closures
- Some \(0/1\) polytopes need exponential size extended formulations
- Disjunctive programming and relaxations of polyhedra
- Disjunctive cuts for continuous linear bilevel programming
- Exact MAX-2SAT solution via lift-and-project closure
- Disjunctive programming and the generalized Leontief input-output model
- A class of stochastic programs with decision dependent uncertainty
- On the optimality of nonlinear fractional disjunctive programming problems
- Strong valid inequalities for orthogonal disjunctions and bilinear covering sets
- Representation for multiple right-hand sides
- Achieving consistency with cutting planes
- Exponential lower bounds for polytopes in combinatorial optimization
- Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems
- Mixed integer linear programming formulation techniques
- Speeding up polyhedral analysis by identifying common constraints
- Mixed integer nonlinear programs featuring ``on/off constraints: convex analysis and applications
- Perspective reformulation and applications
- On the mixing set with a knapsack constraint
- Optimization modulo theories with linear rational costs
- Partial outer convexification for traffic light optimization in road networks
- Finite Disjunctive Programming Characterizations for General Mixed-Integer Linear Programs
- Duality for mixed-integer convex minimization
- Cutting plane algorithm for convex generalized disjunctive programs
- Supplier selection in the processed food industry under uncertainty
- Convex hull characterizations of lexicographic orderings
- Operating room scheduling with generalized disjunctive programming
- Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints
- Global optimization of bilinear programs with a multiparametric disaggregation technique
- A hierarchy of relaxations for linear generalized disjunctive programming
- A hierarchy of relaxations for nonlinear convex generalized disjunctive programming
- Mixed-integer nonlinear programs featuring ``on/off constraints
- The \(st\)-bond polytope on series-parallel graphs
- Numerical solution of optimal control problems with explicit and implicit switches
- New verifiable stationarity concepts for a class of mathematical programs with disjunctive constraints
- Disjunctive programming
- Mathematical programming models and exact algorithms
- Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques
- Cutting planes from extended LP formulations
- A combinatorial approach for small and strong formulations of disjunctive constraints
- Network models with unsplittable node flows with application to unit train scheduling
- scientific article; zbMATH DE number 7310195 (Why is no real title available?)
- Tight lower bounds on the sizes of symmetric extensions of permutahedra and similar results
- Simultaneous convexification of bilinear functions over polytopes with application to network interdiction
- RLT: A unified approach for discrete and continuous nonconvex optimization
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
- scientific article; zbMATH DE number 3298488 (Why is no real title available?)
- Separating stable sets in claw-free graphs via Padberg-Rao and compact linear programs
- Stability in disjunctive linear optimization I: continuity of the feasible set
- Relaxations of mixed integer sets from lattice-free polyhedra
- Extended formulations in combinatorial optimization
- Extended formulations in combinatorial optimization
- Relaxations of mixed integer sets from lattice-free polyhedra
- Discrete relaxations of combinatorial programs
- A computational study of perspective cuts
- Relaxed constant positive linear dependence constraint qualification for disjunctive systems
- Convex mixed-integer nonlinear programs derived from generalized disjunctive programming using cones
- Circuits in extended formulations
This page was built for publication: Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3722274)
