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.
- An efficient linearization technique for mixed 0-1 polynomial problem (Q611852) (← links)
- Stochastic and risk management models and solution algorithm for natural gas transmission network expansion and LNG terminal location planning (Q613606) (← links)
- A heuristic to generate rank-1 GMI cuts (Q621750) (← links)
- On the relative strength of split, triangle and quadrilateral cuts (Q623365) (← links)
- On the behavior of the \(N_{+}\)-operator under blocker duality (Q628328) (← links)
- Random half-integral polytopes (Q635514) (← links)
- An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable (Q645559) (← links)
- Projecting systems of linear inequalities with binary variables (Q646699) (← links)
- A note on the split rank of intersection cuts (Q647399) (← links)
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations (Q652290) (← links)
- Almost robust discrete optimization (Q666949) (← links)
- Global optimization of generalized semi-infinite programs using disjunctive programming (Q670652) (← links)
- Lift-and-project for mixed 0-1 programming: recent progress (Q697568) (← links)
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- Extended formulations for convex hulls of some bilinear functions (Q783025) (← links)
- Depth-optimized convexity cuts (Q817181) (← links)
- Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem (Q817190) (← links)
- Logic-based modeling and solution of nonlinear discrete/continuous optimization problems (Q817192) (← links)
- A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems (Q817200) (← links)
- Projection, lifting and extended formulation integer and combinatorial optimization (Q817203) (← links)
- Reformulating the disjunctive cut generating linear program (Q827289) (← links)
- Column basis reduction and decomposable knapsack problems (Q834182) (← links)
- Conic mixed-integer rounding cuts (Q847842) (← links)
- Computing deep facet-defining disjunctive cuts for mixed-integer programming (Q847850) (← links)
- Minimal \(N_{+}\)-rank graphs: progress on Lipták and Tunçel's conjecture (Q867926) (← links)
- Relaxations of linear programming problems with first order stochastic dominance constraints (Q867928) (← links)
- Semidefinite representations for finite varieties (Q868441) (← links)
- The quadratic knapsack problem -- a survey (Q875597) (← links)
- Cut generation through binarization (Q896284) (← links)
- Two-term disjunctions on the second-order cone (Q896297) (← links)
- New bounds on the unconstrained quadratic integer programming problem (Q925231) (← links)
- 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)