Pages that link to "Item:Q1281382"
From MaRDI portal
The following pages link to Disjunctive programming: Properties of the convex hull of feasible points (Q1281382):
Displaying 50 items.
- A computational comparison of compact MILP formulations for the zero forcing number (Q2328106) (← links)
- ``Facet'' separation with one linear program (Q2330653) (← links)
- Lift-and-project for general two-term disjunctions (Q2339813) (← links)
- On mathematical programming with indicator constraints (Q2349121) (← links)
- Decision tree analysis for a risk averse decision maker: CVaR criterion (Q2356215) (← links)
- Petroleum supply planning: reformulations and a novel decomposition algorithm (Q2358145) (← links)
- A lift-and-project cutting plane algorithm for mixed 0-1 programs (Q2367913) (← links)
- On optimizing over lift-and-project closures (Q2392660) (← links)
- Local cuts for mixed-integer programming (Q2392934) (← links)
- Configuration of airspace sectors for balancing air traffic controller workload (Q2393463) (← links)
- Parameterized extension complexity of independent set and related problems (Q2413967) (← links)
- On the NP-hardness of deciding emptiness of the split closure of a rational polytope in the 0,1 hypercube (Q2419579) (← links)
- Some \(0/1\) polytopes need exponential size extended formulations (Q2434987) (← links)
- Facets for the single node fixed-charge network set with a node set-up variable (Q2448216) (← links)
- Disjunctive programming and relaxations of polyhedra (Q2452382) (← links)
- Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra (Q2462348) (← links)
- On the optimality of nonlinear fractional disjunctive programming problems (Q2519626) (← links)
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations (Q2638381) (← links)
- Strong valid inequalities for orthogonal disjunctions and bilinear covering sets (Q2638385) (← links)
- A constructive characterization of the split closure of a mixed integer linear program (Q2643814) (← links)
- Assembly planning by disjunctive programming and geometrical reasoning (Q2669707) (← links)
- A compact formulation of a mixed-integer set (Q2786320) (← links)
- Mixed integer linear programming formulation techniques (Q2808240) (← links)
- Disjunctive Cuts for Nonconvex MINLP (Q2897296) (← links)
- Linear Programming Relaxations of Quadratically Constrained Quadratic Programs (Q2897305) (← links)
- Optimization Modulo Theories with Linear Rational Costs (Q2946768) (← links)
- Recent Progress in Two-stage Mixed-integer Stochastic Programming with Applications to Power Production Planning (Q2974324) (← links)
- Complexity Analyses of Bienstock–Zuckerberg and Lasserre Relaxations on the Matching and Stable Set Polytopes (Q3009747) (← links)
- Lift-and-Project Cuts for Mixed Integer Convex Programs (Q3009750) (← links)
- Convexification Techniques for Linear Complementarity Constraints (Q3009774) (← links)
- When Lift-and-Project Cuts Are Different (Q3386803) (← links)
- Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints (Q3454970) (← links)
- A Conic Representation of the Convex Hull of Disjunctive Sets and Conic Cuts for Integer Second Order Cone Optimization (Q3462302) (← links)
- Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs (Q3503837) (← links)
- Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints (Q3503848) (← links)
- The Mixing Set with Divisible Capacities (Q3503864) (← links)
- Lifting the facets of zero–one polytopes (Q3865839) (← links)
- A finite cutting plane method for facial disjunctive programs (Q3971356) (← links)
- Polyhedral annexation in mixed integer and combinatorial programming (Q4139972) (← links)
- The Running Intersection Relaxation of the Multilinear Polytope (Q4958553) (← links)
- Polyhedral Results and Branch-and-Cut for the Resource Loading Problem (Q4995060) (← links)
- On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming (Q5041755) (← links)
- Intersection Disjunctions for Reverse Convex Sets (Q5076701) (← links)
- A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation (Q5106379) (← links)
- Disjunctive Programming for Multiobjective Discrete Optimisation (Q5137948) (← links)
- The Ramping Polytope and Cut Generation for the Unit Commitment Problem (Q5137957) (← links)
- Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction (Q5348475) (← links)
- Strong mixed-integer formulations for the floor layout problem (Q5882271) (← links)
- Extended formulations in combinatorial optimization (Q5900907) (← links)
- Lifting convex inequalities for bipartite bilinear programs (Q5918426) (← links)
