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.
- Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming (Q1742902) (← links)
- Two new reformulation convexification based hierarchies for 0-1 MIPs (Q1748458) (← links)
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
- A new lift-and-project operator (Q1752818) (← links)
- Geometric proofs for convex hull defining formulations (Q1755829) (← links)
- Lift-and-project ranks of the set covering polytope of circulant matrices (Q1759829) (← links)
- Reoptimization in Lagrangian methods for the \(0\)-\(1\) quadratic knapsack problem (Q1761937) (← links)
- Lagrangian decomposition of block-separable mixed-integer all-quadratic programs (Q1771303) (← links)
- Partial convexification cuts for 0--1 mixed-integer programs (Q1771349) (← links)
- An improved semidefinite programming relaxation for the satisfiability problem (Q1774165) (← links)
- Cluster based branching for the asymmetric traveling salesman problem (Q1806732) (← links)
- Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems (Q1806944) (← links)
- Computational study of a family of mixed-integer quadratic programming problems (Q1814787) (← links)
- Combinatorial optimization and small polytopes (Q1814809) (← links)
- Lift-and-project ranks and antiblocker duality (Q1886795) (← links)
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming (Q1905964) (← links)
- Tighter representations for set partitioning problems (Q1917353) (← links)
- Dynamic Lagrangian dual and reduced RLT constructs for solving \(0-1\) mixed-integer programs (Q1935886) (← links)
- Fenchel decomposition for stochastic mixed-integer programming (Q1937960) (← links)
- Generalized intersection cuts and a new cut generating paradigm (Q1942255) (← links)
- Semidefinite programming relaxations for the graph partitioning problem (Q1961466) (← links)
- Reduced first-level representations via the reformulation-linearization technique: Results, counterexamples, and computations (Q1975377) (← links)
- A strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problem (Q2028477) (← links)
- Convexification techniques for linear complementarity constraints (Q2045009) (← links)
- Matroid optimization problems with monotone monomials in the objective (Q2064281) (← links)
- On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs (Q2064299) (← links)
- The aggregation closure is polyhedral for packing and covering integer programs (Q2089800) (← links)
- A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming (Q2097632) (← links)
- Decomposition of loosely coupled integer programs: a multiobjective perspective (Q2097645) (← links)
- A decomposition method for distributionally-robust two-stage stochastic mixed-integer conic programs (Q2097655) (← links)
- An L-shaped method with strengthened lift-and-project cuts (Q2109005) (← links)
- On the exact separation of cover inequalities of maximum-depth (Q2115307) (← links)
- 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)