Disjunctive programming: Properties of the convex hull of feasible points
From MaRDI portal
Publication:1281382
DOI10.1016/S0166-218X(98)00136-XzbMath0921.90118MaRDI QIDQ1281382
Publication date: 22 March 1999
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
lift-and-projectsequential convexificationfacial disjunctive programsconvex hull of feasible pointsdisjunctive programreverse polars
Related Items
Petroleum supply planning: reformulations and a novel decomposition algorithm, Reformulating the disjunctive cut generating linear program, On the directed cut cone and polytope, A polyhedral view to a generalization of multiple domination, Solving disjunctive optimization problems by generalized semi-infinite optimization techniques, MIP reformulations of the probabilistic set covering problem, Lagrangean relaxation of the hull-reformulation of linear generalized disjunctive programs and its use in disjunctive branch and bound, Ideal, non-extended formulations for disjunctive constraints admitting a network representation, Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix, Generating cutting planes for the semidefinite relaxation of quadratic programs, A logic-based Benders decomposition for microscopic railway timetable planning, A modified lift-and-project procedure, On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts, Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables, Relaxations of linear programming problems with first order stochastic dominance constraints, Elementary polytopes with high lift-and-project ranks for strong positive semidefinite operators, Complete formulations of polytopes related to extensions of assignment matrices, On optimality and duality theorems of nonlinear disjunctive fractional minmax programs, Solving linear optimization over arithmetic constraint formula, Global optimization of disjunctive programs, A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function, Strengthening cuts for mixed integer programs, Packing, partitioning, and covering symresacks, Reverse split rank, Simple extensions of polytopes, Two-term disjunctions on the second-order cone, Outer-product-free sets for polynomial optimization and oracle-based cuts, A hierarchy of relaxations for linear generalized disjunctive programming, Cardinality constrained combinatorial optimization: complexity and polyhedra, Convex hulls of superincreasing knapsacks and lexicographic orderings, Foundation-penalty cuts for mixed-integer programs., Fitting piecewise linear continuous functions, Mixed integer linear programming formulations for probabilistic constraints, A finitely convergent procedure for facial disjunctive programs, Intersection cuts from multiple rows: a disjunctive programming approach, On the facet defining inequalities of the mixed-integer bilinear covering set, Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations, The mixing-MIR set with divisible capacities, Models for representing piecewise linear cost functions, Strong-branching inequalities for convex mixed integer nonlinear programs, On total \(f\)-domination: polyhedral and algorithmic results, Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming, A study on optimality and duality theorems of nonlinear generalized disjunctive fractional programming, Valid inequalities for the single arc design problem with set-ups, Circuit and bond polytopes on series-parallel graphs, A class of valid inequalities for multilinear 0-1 optimization problems, Cook, Kannan and Schrijver's example revisited, Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets, An interleaved depth-first search method for the linear optimization problem with disjunctive constraints, Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs, Integrating operations and marketing decisions using delayed differentiation of products and guaranteed delivery time under stochastic demand, Lift-and-project for mixed 0-1 programming: recent progress, Integral polyhedra related to integer multicommodity flows on a cycle, Modeling disjunctive constraints with a logarithmic number of binary variables and constraints, On the separation of disjunctive cuts, Partial convexification cuts for 0--1 mixed-integer programs, Mixing polyhedra with two non divisible coefficients, A note on duality in disjunctive programming, Multi-step methods for choosing the best set of variables in regression analysis, Split cuts and extended formulations for mixed integer conic quadratic programming, Note on the complexity of the mixed-integer hull of a polyhedron, Optimum turn-restricted paths, nested compatibility, and optimum convex polygons, Centered solutions for uncertain linear equations, Valid inequalities for mixed integer linear programs, Extended formulations for vertex cover, Valid inequalities for concave piecewise linear regression, Convexification techniques for linear complementarity constraints, Balas formulation for the union of polytopes is optimal, On the structure of linear programs with overlapping cardinality constraints, Stable sets and graphs with no even holes, A compact formulation of the ring loading problem with integer demand splitting, On the polyhedral lift-and-project methods and the fractional stable set polytope, \textsc{OptiMathSAT}: a tool for optimization modulo theories, Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation, Testing weak optimality of a given solution in interval linear programming revisited: NP-hardness proof, algorithm and some polynomially-solvable cases, On solving two-stage distributionally robust disjunctive programs with a general ambiguity set, Modelling either-or relations in integer programming, The splitting of variables and constraints in the formulation of integer programming models, Sequential convexification in reverse convex and disjunctive programming, Representability of functions, Refined cut selection for Benders decomposition: applied to network capacity expansion problems, Extension complexity of formal languages, A computational comparison of compact MILP formulations for the zero forcing number, \(S\)-hypersimplices, pulling triangulations, and monotone paths, ``Facet separation with one linear program, Worst-case analysis of clique MIPs, The aggregation closure is polyhedral for packing and covering integer programs, Lift-and-project for general two-term disjunctions, Decomposition of loosely coupled integer programs: a multiobjective perspective, A decomposition method for distributionally-robust two-stage stochastic mixed-integer conic programs, Evolution and state-of-the-art in integer programming, Combinatorial optimization: current successes and directions for the future, Accelerating logic-based benders decomposition for railway rescheduling by exploiting similarities in delays, On mathematical programming with indicator constraints, Between steps: intermediate relaxations between big-M and convex hull formulations, Decision tree analysis for a risk averse decision maker: CVaR criterion, On generalized surrogate duality in mixed-integer nonlinear programming, On a generalization of the Chvátal-Gomory closure, 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, Strong mixed-integer formulations for the floor layout problem, On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming, A lift-and-project cutting plane algorithm for mixed 0-1 programs, A finite cutting plane method for facial disjunctive programs, Disjunctive Cuts for Nonconvex MINLP, Linear Programming Relaxations of Quadratically Constrained Quadratic Programs, Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints, Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations, Strong valid inequalities for orthogonal disjunctions and bilinear covering sets, A Conic Representation of the Convex Hull of Disjunctive Sets and Conic Cuts for Integer Second Order Cone Optimization, A constructive characterization of the split closure of a mixed integer linear program, On optimizing over lift-and-project closures, Local cuts for mixed-integer programming, Configuration of airspace sectors for balancing air traffic controller workload, Intersection Disjunctions for Reverse Convex Sets, Assembly planning by disjunctive programming and geometrical reasoning, Parameterized extension complexity of independent set and related problems, Optimization Modulo Theories with Linear Rational Costs, Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction, Set covering heuristics in a benders decomposition for railway timetabling, On the NP-hardness of deciding emptiness of the split closure of a rational polytope in the 0,1 hypercube, A linear programming based approach to the Steiner tree problem with a fixed number of terminals, Shadows of Newton polytopes, Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs, Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints, The Mixing Set with Divisible Capacities, A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation, Modeling combinatorial disjunctive constraints via junction trees, Service center location problems with decision dependent utilities and a pandemic case study, On permuting some coordinates of polytopes, Some \(0/1\) polytopes need exponential size extended formulations, Recent Progress in Two-stage Mixed-integer Stochastic Programming with Applications to Power Production Planning, Facets for the single node fixed-charge network set with a node set-up variable, Disjunctive Programming for Multiobjective Discrete Optimisation, The Ramping Polytope and Cut Generation for the Unit Commitment Problem, Disjunctive programming and relaxations of polyhedra, Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra, Complexity Analyses of Bienstock–Zuckerberg and Lasserre Relaxations on the Matching and Stable Set Polytopes, Lift-and-Project Cuts for Mixed Integer Convex Programs, Convexification Techniques for Linear Complementarity Constraints, Extended formulations in combinatorial optimization, Relaxations of mixed integer sets from lattice-free polyhedra, Polyhedral annexation in mixed integer and combinatorial programming, A compact formulation of a mixed-integer set, Lifting the facets of zero–one polytopes, The Running Intersection Relaxation of the Multilinear Polytope, Lifting convex inequalities for bipartite bilinear programs, On the optimality of nonlinear fractional disjunctive programming problems, Mixed Integer Linear Programming Formulation Techniques, Strong mixed-integer programming formulations for trained neural networks, Lifting convex inequalities for bipartite bilinear programs, When Lift-and-Project Cuts Are Different, Polyhedral Results and Branch-and-Cut for the Resource Loading Problem
Cites Work
