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.
- The mixing-MIR set with divisible capacities (Q930344) (← links)
- Computations with disjunctive cuts for two-stage stochastic mixed 0-1 integer programs (Q934793) (← links)
- Exploiting equalities in polynomial programming (Q935230) (← links)
- Approximate formulations for 0-1 knapsack sets (Q943790) (← links)
- An algorithmic framework for convex mixed integer nonlinear programs (Q951092) (← links)
- Intermediate integer programming representations using value disjunctions (Q951104) (← links)
- On the complexity of cutting-plane proofs using split cuts (Q969513) (← links)
- Valid inequalities for mixed integer linear programs (Q995784) (← links)
- Block-diagonal semidefinite programming hierarchies for 0/1 programming (Q1002080) (← links)
- On the polyhedral lift-and-project methods and the fractional stable set polytope (Q1015326) (← links)
- A geometric characterization of ``optimality-equivalent'' relaxations (Q1016070) (← links)
- Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation (Q1019294) (← links)
- A linearization framework for unconstrained quadratic (0-1) problems (Q1025991) (← links)
- A reformulation-linearization technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions (Q1025998) (← links)
- Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants (Q1043853) (← links)
- 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)