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.
- Light on the infinite group relaxation. I: Foundations and taxonomy (Q262442) (← links)
- A dynamic inequality generation scheme for polynomial programming (Q263184) (← links)
- Lift-and-project ranks of the stable set polytope of joined \(a\)-perfect graphs (Q299078) (← links)
- Integrality gaps for strengthened linear relaxations of capacitated facility location (Q304227) (← links)
- Characterization of the split closure via geometric lifting (Q319191) (← links)
- An approach to the asymmetric multi-depot capacitated arc routing problem (Q319291) (← links)
- Generating cutting planes for the semidefinite relaxation of quadratic programs (Q337405) (← links)
- On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts (Q344930) (← links)
- Strong lift-and-project cutting planes for the stable set problem (Q378110) (← links)
- Rank of Handelman hierarchy for Max-Cut (Q408389) (← links)
- Tightening simple mixed-integer sets with guaranteed bounds (Q431027) (← links)
- Split cuts for robust mixed-integer optimization (Q439905) (← links)
- On linear programs with linear complementarity constraints (Q452341) (← links)
- Intersection cuts from multiple rows: a disjunctive programming approach (Q458123) (← links)
- Reflections on generating (disjunctive) cuts (Q458126) (← links)
- Strong-branching inequalities for convex mixed integer nonlinear programs (Q480939) (← links)
- The ancestral Benders' cutting plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming (Q507318) (← links)
- How to convexify the intersection of a second order cone and a nonconvex quadratic (Q517311) (← links)
- A brief history of lift-and-project (Q537586) (← links)
- Revival of the Gomory cuts in the 1990's (Q537587) (← links)
- RLT: A unified approach for discrete and continuous nonconvex optimization (Q537611) (← links)
- Branching on general disjunctions (Q543420) (← links)
- DRL\(^*\): A hierarchy of strong block-decomposable linear relaxations for 0-1 mips (Q608295) (← links)
- 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)
