The following pages link to Cornuéjols, Gérard (Q163019):
Displayed 50 items.
- On some polytopes contained in the 0,1 hypercube that have a small Chvátal rank (Q1801017) (← links)
- TRAVEL - An interactive travelling salesman problem package for the IBM- personal computer (Q1821039) (← links)
- Decomposition of odd-hole-free graphs by double star cutsets and 2-joins (Q1827853) (← links)
- A connection between cutting plane theory and the geometry of numbers (Q1849263) (← links)
- Balanced \(0,\pm 1\) matrices. I: Decomposition (Q1850525) (← links)
- Balanced \(0,\pm 1\) matrices. II: Recognition algorithm (Q1850526) (← links)
- Balanced \(0,\pm 1\)-matrices, bicoloring and total dual integrality (Q1919803) (← links)
- The ongoing story of Gomory cuts (Q1946022) (← links)
- Lifting Gomory cuts with bounded variables (Q1949677) (← links)
- Cuboids, a class of clutters (Q1985449) (← links)
- A new infinite class of ideal minimally non-packing clutters (Q2032738) (← links)
- Testing idealness in the filter oracle model (Q2102851) (← links)
- Idealness of \(k\)-wise intersecting families (Q2118114) (← links)
- Correction to: ``Idealness of \(k\)-wise intersecting families'' (Q2118115) (← links)
- Total dual dyadicness and dyadic generating sets (Q2164668) (← links)
- The max-flow min-cut property and \(\pm 1\)-resistant sets (Q2217497) (← links)
- Compositions for perfect graphs (Q2266722) (← links)
- On the rational polytopes with Chvátal rank 1 (Q2288183) (← links)
- Identically self-blocking clutters (Q2293080) (← links)
- Idealness and 2-resistant sets (Q2294336) (← links)
- On the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs (Q2340339) (← links)
- A lift-and-project cutting plane algorithm for mixed 0-1 programs (Q2367913) (← links)
- On the facets of mixed integer programs with two integer variables and two constraints (Q2390999) (← links)
- When the Gomory-chvátal closure coincides with the integer hull (Q2417111) (← links)
- Balanced matrices (Q2433704) (← links)
- A 3-slope theorem for the infinite relaxation in the plane (Q2434989) (← links)
- Cutting planes from two-term disjunctions (Q2450685) (← links)
- Projected Chvátal-Gomory cuts for mixed integer linear programs (Q2476991) (← links)
- A convex-analysis perspective on disjunctive cuts (Q2492679) (← links)
- Recognizing Berge graphs (Q2494439) (← links)
- Perfect matchings in balanced hypergraphs (Q2563509) (← links)
- Gomory cuts revisited (Q2564234) (← links)
- Intersecting restrictions in clutters (Q2658378) (← links)
- Clean tangled clutters, simplices, and projective geometries (Q2668014) (← links)
- Combinatorial Optimization (Q2716048) (← links)
- Even-hole-free graphs part I: Decomposition theorem (Q2778281) (← links)
- Cut-Generating Functions for Integer Variables (Q2833108) (← links)
- The Chvátal closure of generalized stable sets in bidirected graphs (Q2840520) (← links)
- (Q2861546) (← links)
- Intersection Cuts with Infinite Split Rank (Q2884303) (← links)
- Unique Minimal Liftings for Simplicial Polytopes (Q2884321) (← links)
- K-Cuts: A Variation of Gomory Mixed Integer Cuts from the LP Tableau (Q2884566) (← links)
- Early Estimates of the Size of Branch-and-Bound Trees (Q2892274) (← links)
- Experiments with Two-Row Cuts from Degenerate Tableaux (Q2899149) (← links)
- (Q2928710) (← links)
- Convex Sets and Minimal Sublinear Functions (Q2997129) (← links)
- A Probabilistic Analysis of the Strength of the Split and Triangle Closures (Q3009748) (← links)
- Minimal Inequalities for an Infinite Relaxation of Integer Programs (Q3084218) (← links)
- A Geometric Perspective on Lifting (Q3109861) (← links)
- Reduce-and-Split Cuts: Improving the Performance of Mixed-Integer Gomory Cuts (Q3115940) (← links)