Pages that link to "Item:Q2367913"
From MaRDI portal
The following pages link to A lift-and-project cutting plane algorithm for mixed 0-1 programs (Q2367913):
Displaying 50 items.
- Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming (Q2490333) (← links)
- Perspective cuts for a class of convex 0-1 mixed integer programs (Q2490334) (← links)
- Clutter nonidealness (Q2492208) (← links)
- A convex-analysis perspective on disjunctive cuts (Q2492679) (← links)
- On the gap between the quadratic integer programming problem and its semidefinite relaxation (Q2492705) (← links)
- Several notes on the power of Gomory-Chvátal cuts (Q2498920) (← links)
- On the commutativity of antiblocker diagrams under lift-and-project operators (Q2500533) (← links)
- On solving discrete two-stage stochastic programs having mixed-integer first- and second-stage variables (Q2502216) (← links)
- A note on modeling multiple choice requirements for simple mixed integer programming solvers (Q2563892) (← links)
- Gomory cuts revisited (Q2564234) (← links)
- The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification (Q2570997) (← links)
- Cuts for mixed 0-1 conic programming (Q2571004) (← links)
- Polyhedra related to integer-convex polynomial systems (Q2583123) (← links)
- Mixed integer models for the stationary case of gas network optimization (Q2583142) (← links)
- Valid inequalities based on simple mixed-integer sets (Q2583149) (← links)
- Perspective reformulations of mixed integer nonlinear programs with indicator variables (Q2638370) (← links)
- Small Chvátal rank (Q2638380) (← 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)
- Mixed-integer sets from two rows of two adjacent simplex bases (Q2638388) (← links)
- An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs (Q2643148) (← links)
- Generalised 2-circulant inequalities for the max-cut problem (Q2670485) (← links)
- Achieving consistency with cutting planes (Q2687054) (← links)
- Integer set reduction for stochastic mixed-integer programming (Q2701423) (← links)
- Second order cone programming relaxation of nonconvex quadratic optimization problems (Q2770189) (← links)
- A Comprehensive Analysis of Polyhedral Lift-and-Project Methods (Q2790405) (← links)
- Exponential Lower Bounds for Polytopes in Combinatorial Optimization (Q2796404) (← links)
- The Cutting Plane Method is Polynomial for Perfect Matchings (Q2800362) (← links)
- Disjunctive Decomposition for Two-Stage Stochastic Mixed-Binary Programs with Generalized Upper Bound Constraints (Q2815438) (← links)
- Exploring the disjunctive rank of some facet-inducing inequalities of the acyclic coloring polytope (Q2826670) (← links)
- Strength of facets for the set covering and set packing polyhedra on circulant matrices (Q2840523) (← links)
- On the dominating set polytope of web graphs (Q2840527) (← links)
- Disjunctive ranks and anti-ranks of some facet-inducing inequalities of the acyclic coloring polytope (Q2840711) (← links)
- (Q2861537) (← links)
- (Q2861550) (← links)
- (Q2861558) (← links)
- Rank of random half-integral polytopes — extended abstract — (Q2883588) (← links)
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs (Q2897292) (← links)
- Subgradient Based Outer Approximation for Mixed Integer Second Order Cone Programming (Q2897293) (← links)
- Disjunctive Cuts for Nonconvex MINLP (Q2897296) (← links)
- Computation with Polynomial Equations and Inequalities Arising in Combinatorial Optimization (Q2897307) (← links)
- SOME EXPERIENCES WITH SOLVING SEMIDEFINITE PROGRAMMING RELAXATIONS OF BINARY QUADRATIC OPTIMIZATION MODELS IN COMPUTATIONAL BIOLOGY (Q2931718) (← 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)
- Design and Verify: A New Scheme for Generating Cutting-Planes (Q3009757) (← links)
- An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming (Q3009764) (← links)
- Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack (Q3009771) (← links)
- Convexification Techniques for Linear Complementarity Constraints (Q3009774) (← links)
- Comparing Imperfection Ratio and Imperfection Index for Graph Classes (Q3163670) (← links)
- Convex Relaxations for Quadratic On/Off Constraints and Applications to Optimal Transmission Switching (Q3386791) (← links)