Pages that link to "Item:Q3083313"
From MaRDI portal
The following pages link to Constrained Infinite Group Relaxations of MIPs (Q3083313):
Displayed 25 items.
- Light on the infinite group relaxation. I: Foundations and taxonomy (Q262442) (← links)
- On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts (Q344930) (← links)
- Unique lifting of integer variables in minimal inequalities (Q378135) (← links)
- Strengthening lattice-free cuts using non-negativity (Q429683) (← links)
- Sufficiency of cut-generating functions (Q494318) (← links)
- Joint task assignment and cache partitioning with cache locking for WCET minimization on MPSoC (Q645822) (← links)
- Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra (Q715090) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- A quantitative Doignon-Bell-Scarf theorem (Q1743170) (← links)
- Intersection cuts -- standard versus restricted (Q1751139) (← links)
- On a generalization of the Chvátal-Gomory closure (Q2118122) (← links)
- Maximal quadratic-free sets (Q2118125) (← links)
- Outer-product-free sets for polynomial optimization and oracle-based cuts (Q2196293) (← links)
- The strength of multi-row aggregation cuts for sign-pattern integer programs (Q2294249) (← links)
- A geometric approach to cut-generating functions (Q2349120) (← links)
- Cut-Generating Functions for Integer Variables (Q2833108) (← links)
- Computational Experiments with Cross and Crooked Cross Cuts (Q2940067) (← links)
- On the Practical Strength of Two-Row Tableau Cuts (Q2962551) (← links)
- Operations that Preserve the Covering Property of the Lifting Region (Q3454508) (← links)
- Maximal Quadratic-Free Sets (Q5041754) (← links)
- Intersection Disjunctions for Reverse Convex Sets (Q5076701) (← links)
- Cut-Generating Functions and <i>S</i>-Free Sets (Q5252221) (← links)
- Lifting convex inequalities for bipartite bilinear programs (Q5918426) (← links)
- On the implementation and strengthening of intersection cuts for QCQPs (Q5925638) (← links)
- Lifting convex inequalities for bipartite bilinear programs (Q5925639) (← links)
