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.
- On mathematical programming with indicator constraints (Q2349121) (← links)
- Large-scale unit commitment under uncertainty (Q2351161) (← links)
- Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem (Q2391873) (← links)
- On optimizing over lift-and-project closures (Q2392660) (← links)
- Handelman rank of zero-diagonal quadratic programs over a hypercube and its applications (Q2392765) (← links)
- Local cuts for mixed-integer programming (Q2392934) (← links)
- A note on the 2-circulant inequalities for the MAX-cut problem (Q2417185) (← links)
- Integrality gaps for colorful matchings (Q2419586) (← links)
- The Steiner connectivity problem (Q2434988) (← links)
- Coordinated cutting plane generation via multi-objective separation (Q2436641) (← links)
- A decomposition approach to the two-stage stochastic unit commitment problem (Q2442096) (← links)
- On the facets of lift-and-project relaxations under graph operations (Q2448871) (← links)
- Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs (Q2452371) (← links)
- Bi-criteria and approximation algorithms for restricted matchings (Q2453169) (← links)
- Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra (Q2462348) (← links)
- Disjunctive cuts for continuous linear bilevel programming (Q2463829) (← links)
- Exact MAX-2SAT solution via lift-and-project closure (Q2466587) (← links)
- Constrained 0-1 quadratic programming: basic approaches and extensions (Q2467302) (← links)
- Optimizing over the split closure (Q2476990) (← links)
- Projected Chvátal-Gomory cuts for mixed integer linear programs (Q2476991) (← links)
- A semidefinite programming heuristic for quadratic programming problems with complementarity constraints (Q2487469) (← links)
- 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)