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.
- Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems (Q1278590) (← links)
- A cutting-plane approach to mixed 0-1 stochastic integer programs (Q1278962) (← links)
- Lower bounds for nonlinear assignment problems using many body interactions (Q1291723) (← links)
- A variant of time minimizing assignment problem (Q1303581) (← links)
- Logic cuts for processing networks with fixed charges (Q1317071) (← links)
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems (Q1329799) (← links)
- Solving \(0/1\) integer programs with enumeration cutting planes (Q1339119) (← links)
- A modified lift-and-project procedure (Q1365045) (← links)
- Semidefinite programming in combinatorial optimization (Q1365053) (← links)
- Links between linear bilevel and mixed 0-1 programming problems (Q1379953) (← links)
- Foundation-penalty cuts for mixed-integer programs. (Q1413909) (← links)
- Lift and project relaxations for the matching and related polytopes (Q1421469) (← links)
- Projections of the capacitated network loading problem (Q1577107) (← links)
- ProGen/\(\pi x\) -- An instance generator for resource-constrained project scheduling problems with partially renewable resources and further extensions (Q1578557) (← links)
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem (Q1602704) (← links)
- Strengthening Chvátal-Gomory cuts and Gomory fractional cuts (Q1612007) (← links)
- The disjunctive procedure and blocker duality (Q1613383) (← links)
- Binary extended formulations of polyhedral mixed-integer sets (Q1650775) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- Elementary polytopes with high lift-and-project ranks for strong positive semidefinite operators (Q1662113) (← links)
- Minimal arc-sets spanning dicycles (Q1707911) (← links)
- Monoidal cut strengthening and generalized mixed-integer rounding for disjunctions and complementarity constraints (Q1728353) (← links)
- Large-scale unit commitment under uncertainty: an updated literature survey (Q1730531) (← links)
- 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)