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):
Displayed 50 items.
- A disjunctive cut strengthening technique for convex MINLP (Q2129197) (← links)
- Discrete dynamical system approaches for Boolean polynomial optimization (Q2161551) (← links)
- Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables (Q2164683) (← links)
- Partial hyperplane activation for generalized intersection cuts (Q2175444) (← links)
- Dynamic intersection of multiple implicit Dantzig-Wolfe decompositions applied to the adjacent only quadratic minimum spanning tree problem (Q2178061) (← links)
- Split cuts from sparse disjunctions (Q2195684) (← links)
- On the facet defining inequalities of the mixed-integer bilinear covering set (Q2216198) (← links)
- Design and verify: a new scheme for generating cutting-planes (Q2248750) (← links)
- Convex hull representation of the deterministic bipartite network interdiction problem (Q2248756) (← links)
- RLT insights into lift-and-project closures (Q2257076) (← links)
- Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design (Q2273684) (← links)
- A generalized Benders decomposition-based branch and cut algorithm for two-stage stochastic programs with nonconvex constraints and mixed-binary first and second stage variables (Q2274882) (← links)
- Pivot-and-reduce cuts: an approach for improving Gomory mixed-integer cuts (Q2275620) (← links)
- On pathological disjunctions and redundant disjunctive conic cuts (Q2294223) (← links)
- Balas formulation for the union of polytopes is optimal (Q2297650) (← links)
- On solving two-stage distributionally robust disjunctive programs with a general ambiguity set (Q2312325) (← 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)
- 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)