Disjunctive Programming
From MaRDI portal
Publication:4197624
DOI10.1016/S0167-5060(08)70342-XzbMath0409.90061OpenAlexW4253741566MaRDI QIDQ4197624
Publication date: 1979
Published in: Discrete Optimization II, Proceedings of the Advanced Research Institute on Discrete Optimization and Systems Applications of the Systems Science Panel of NATO and of the Discrete Optimization Symposium co-sponsored by IBM Canada and SIAM Banff, Aha. and Vancouver (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-5060(08)70342-x
Numerical ExamplesInteger ProgrammingCutting PlanesDisjunctive ProgrammingBranch-And- Bound AlgorithmConvex Analysis ApproachDisjunctive ConstraintsMultiple Choice ConstraintsPolarity Concept
Related Items
Extensions of a theorem of Balas, Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems, Duality in disjunctive programming via vector optimization, Column basis reduction and decomposable knapsack problems, Representability in mixed integer programming. I: Characterization results, Solving disjunctive optimization problems by generalized semi-infinite optimization techniques, MIR closures of polyhedral sets, Conic mixed-integer rounding cuts, Computing deep facet-defining disjunctive cuts for mixed-integer programming, Characterization of the split closure via geometric lifting, A simplification for some disjunctive formulations, Binary extended formulations of polyhedral mixed-integer sets, Theoretical challenges towards cutting-plane selection, A complementarity-based partitioning and disjunctive cut algorithm for mathematical programming problems with equilibrium constraints, Locating hyperplanes to fitting set of points: a general framework, Operating room scheduling with generalized disjunctive programming, Short-term scheduling of multiple source pipelines with simultaneous injections and deliveries, A modified lift-and-project procedure, Relaxations of linear programming problems with first order stochastic dominance constraints, On optimality and duality theorems of nonlinear disjunctive fractional minmax programs, Strong formulations for mixed integer programming: A survey, Disjunctive optimization: Critical point theory, Constrained optimization using multiple objective programming, Three modeling paradigms in mathematical programming, DRL\(^*\): A hierarchy of strong block-decomposable linear relaxations for 0-1 mips, Practical strategies for generating rank-1 split cuts in mixed-integer linear programming, A mean-risk mixed integer nonlinear program for transportation network protection, On interval-subgradient and no-good cuts, Stochastic and risk management models and solution algorithm for natural gas transmission network expansion and LNG terminal location planning, Enhancing local search algorithms for job shops with MIN-sum objectives by approximate move evaluation, Symmetry breaking for generalized disjunctive programming formulation of the strip packing problem, Bilevel programming and the separation problem, A perspective-based convex relaxation for switched-affine optimal control, On mixed-integer sets with two integer variables, Simple extensions of polytopes, Two-term disjunctions on the second-order cone, A hierarchy of relaxations for linear generalized disjunctive programming, Lift-and-project cuts for convex mixed integer nonlinear programs, Facial disjunctive programs and sequences of cutting-planes, An LPCC approach to nonconvex quadratic programs, Clique-based facets for the precedence constrained knapsack problem, Maximum semidefinite and linear extension complexity of families of polytopes, A note on the MIR closure and basic relaxations of polyhedra, A computational study of the cutting plane tree algorithm for general mixed-integer linear programs, Monoidal cut strengthening revisited, A finite cutting plane method for solving linear programs with an additional reverse convex constraint, Foundation-penalty cuts for mixed-integer programs., A hierarchy of relaxations for nonlinear convex generalized disjunctive programming, Split cuts for robust mixed-integer optimization, Projecting systems of linear inequalities with binary variables, Mixed-integer nonlinear programs featuring ``on/off constraints, A note on the split rank of intersection cuts, Intersection cuts from multiple rows: a disjunctive programming approach, Reflections on generating (disjunctive) cuts, Chvátal closures for mixed integer programming problems, Improved strategies for branching on general disjunctions, Enhanced mixed integer programming techniques and routing problems, The mixing-MIR set with divisible capacities, A finite algorithm for solving the generalized lattice point problem, Computations with disjunctive cuts for two-stage stochastic mixed 0-1 integer programs, Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions, Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming, Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques, The ancestral Benders' cutting plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming, A study on optimality and duality theorems of nonlinear generalized disjunctive fractional programming, Lagrangean duality for facial programs with applications to integer and complementarity problems, Generalized coefficient strengthening cuts for mixed integer programming, How to convexify the intersection of a second order cone and a nonconvex quadratic, A complete characterization of disjunctive conic cuts for mixed integer second order cone optimization, Relaxations for probabilistically constrained programs with discrete random variables, Cook, Kannan and Schrijver's example revisited, Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs, Mingling: mixed-integer rounding with bounds, Mixing MIR inequalities with two divisible coefficients, Progress in computational mixed integer programming -- a look back from the other side of the tipping point, A brief history of lift-and-project, Strong valid inequalities for fluence map optimization problem under dose-volume restrictions, Lift-and-project for mixed 0-1 programming: recent progress, Cutting planes in integer and mixed integer programming, Modeling disjunctive constraints with a logarithmic number of binary variables and constraints, On the separation of disjunctive cuts, Split closure and intersection cuts, Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra, On the equivalence of the Max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems, On the existence of compact $\varepsilon$-approximated formulations for knapsack in the original space, Subgraph polytopes and independence polytopes of count matroids, A comparative study of decomposition algorithms for stochastic combinatorial optimization, Valid inequalities for separable concave constraints with indicator variables, Deterministic job-shop scheduling: Past, present and future, Two mixed integer programming formulations arising in manufacturing management, Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation, Modelling either-or relations in integer programming, Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants, Duality in disjunctive linear fractional programming, Mixed global constraints and inference in hybrid CLP--IP solvers, Tight bounds for capacities, Logic-based modeling and solution of nonlinear discrete/continuous optimization problems, Projection, lifting and extended formulation integer and combinatorial optimization, Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints, Strengthening Chvátal-Gomory cuts and Gomory fractional cuts, Disjunctive cuts in mixed-integer conic optimization, Lifts for Voronoi cells of lattices, A computational study of perspective cuts, Monoidal strengthening of simple \(\mathcal{V} \)-polyhedral disjunctive cuts, Optimization problems involving matrix multiplication with applications in materials science and biology, Optimization under uncertainty and risk: quadratic and copositive approaches, Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness, Modeling combinatorial disjunctive constraints via junction trees, Network Models with Unsplittable Node Flows with Application to Unit Train Scheduling, A Noncompact Formulation for Job-Shop Scheduling Problems in Traffic Management, The Ramping Polytope and Cut Generation for the Unit Commitment Problem, Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint, Relaxations of mixed integer sets from lattice-free polyhedra, Approximate and exact merging of knapsack constraints with cover inequalities, Relaxations of mixed integer sets from lattice-free polyhedra, Elementary closures for integer programs., Stability in disjunctive linear optimization I: continuity of the feasible set, Extended formulations from communication protocols in output-efficient time, Cut-Generating Functions and S-Free Sets, Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles, A disjunctive cut strengthening technique for convex MINLP, Facet inequalities from simple disjunctions in cutting plane theory, A lift-and-project cutting plane algorithm for mixed 0-1 programs, A finite cutting plane method for facial disjunctive programs, Algorithms and Software for Convex Mixed Integer Nonlinear Programs, On handling indicator constraints in mixed integer programming, Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints, Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems, Data-driven project portfolio selection: decision-dependent stochastic programming formulations with reliability and time to market requirements, Set covering problem with conflict constraints, Comparison of mixed-integer relaxations with linear and logarithmic partitioning schemes for quadratically constrained problems, Two row mixed-integer cuts via lifting, Strong valid inequalities for orthogonal disjunctions and bilinear covering sets, Ideal, non-extended formulations for disjunctive constraints admitting a network representation, A Conic Representation of the Convex Hull of Disjunctive Sets and Conic Cuts for Integer Second Order Cone Optimization, Tree-width and the Sherali-Adams operator, Valid Inequalities for Separable Concave Constraints with Indicator Variables, Probabilistic constraint tightening techniques for trajectory planning with predictive control, An Exact Decomposition Approach for the Real-Time Train Dispatching Problem, Intersection Disjunctions for Reverse Convex Sets, Regular Matroids Have Polynomial Extension Complexity, Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables, SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs, Sampling from the complement of a polyhedron: an MCMC algorithm for data augmentation, Piecewise polyhedral formulations for a multilinear term, Partial hyperplane activation for generalized intersection cuts, Computational Experiments with Cross and Crooked Cross Cuts, An outer-approximation algorithm for a class of mixed-integer nonlinear programs, Assembly planning by disjunctive programming and geometrical reasoning, A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function, Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints, Fenchel decomposition for stochastic mixed-integer programming, Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming, Relaxations of Discrete Sets with Semicontinuous Variables, Convex envelopes generated from finitely many compact convex sets, Achieving consistency with cutting planes, A decomposition approach to the two-stage stochastic unit commitment problem, On families of quadratic surfaces having fixed intersections with two hyperplanes, Mixed logical-linear programming, On the facet defining inequalities of the mixed-integer bilinear covering set, Locally ideal formulations for piecewise linear functions with indicator variables, Strengthening convex relaxations of 0/1-sets using Boolean formulas, A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems, Exact MAX-2SAT solution via lift-and-project closure, Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs, Two-Stage Stochastic Mixed-Integer Programs: Algorithms and Insights, No-wait job shop scheduling: tabu search and complexity of subproblems, Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming, Semi-continuous network flow problems, Optimality-based bound contraction with multiparametric disaggregation for the global optimization of mixed-integer bilinear problems, Optimizing over the split closure, Discrete and continuous-time formulations for dealing with break periods: preemptive and non-preemptive scheduling, Real time management of a metro rail terminus, Disjunctive programming and the generalized Leontief input-output model, Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming, Unnamed Item, A convex-analysis perspective on disjunctive cuts, Non-Convex feasibility problems and proximal point methods, The million-variable ``march for stochastic combinatorial optimization, Outer approximation for integer nonlinear programs via decision diagrams, Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design, Alternative graph formulation for solving complex factory-scheduling problems, The split closure of a strictly convex body, Strong formulations of robust mixed 0-1 programming, Efficient formulation for transportation scheduling of single refinery multiproduct pipelines, Solving linear programs with complementarity constraints using branch-and-cut, The Cutting Plane Method is Polynomial for Perfect Matchings, Minimal inequalities, A note on the continuous mixing set, On Minimal Valid Inequalities for Mixed Integer Conic Programs, On the optimality of nonlinear fractional disjunctive programming problems, Mixed Integer Linear Programming Formulation Techniques, Disjunctive Decomposition for Two-Stage Stochastic Mixed-Binary Programs with Generalized Upper Bound Constraints, Mathematical Models and Search Algorithms for the Capacitated p-Center Problem, When Lift-and-Project Cuts Are Different, On solving two-stage distributionally robust disjunctive programs with a general ambiguity set, Future paths for integer programming and links to artificial intelligence, Sequential convexification in reverse convex and disjunctive programming, Representability of functions, Lagrangian duality of concave minimization subject to linear constraints and an additional facial reverse convex constraint, Minimum cost \(b\)-matching problems with neighborhoods, ``Facet separation with one linear program, On cutting planes for cardinality-constrained linear programs, The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification, Cuts for mixed 0-1 conic programming, Job-shop scheduling with blocking and no-wait constraints, Lift-and-project for general two-term disjunctions, On the separation of split inequalities for non-convex quadratic integer programming, Multilinear sets with two monomials and cardinality constraints, A framework for generalized Benders' decomposition and its application to multilevel optimization, Decomposition of loosely coupled integer programs: a multiobjective perspective, On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs, Approximate extended formulations, Symbolic model checking of timed guarded commands using difference decision diagrams, Stability in disjunctive optimization II:continuity of the feasible and optimal set, On mathematical programming with indicator constraints, An L-shaped method with strengthened lift-and-project cuts, Disjunctive optimization, \(\max\)-separable problems and extremal algebras, Extended formulations for stable set polytopes of graphs without two disjoint odd cycles
