The following pages link to Cornuéjols, Gérard (Q163019):
Displaying 50 items.
- (Q189537) (redirect page) (← links)
- Unique lifting of integer variables in minimal inequalities (Q378135) (← links)
- Practical strategies for generating rank-1 split cuts in mixed-integer linear programming (Q384805) (← links)
- A counterexample to a conjecture of Gomory and Johnson (Q431022) (← links)
- How tight is the corner relaxation? Insights gained from the stable set problem (Q448970) (← links)
- Mixed-integer nonlinear programs featuring ``on/off'' constraints (Q453616) (← links)
- Sufficiency of cut-generating functions (Q494318) (← links)
- Revival of the Gomory cuts in the 1990's (Q537587) (← links)
- Branching on general disjunctions (Q543420) (← links)
- On the relative strength of split, triangle and quadrilateral cuts (Q623365) (← links)
- (Q652282) (redirect page) (← links)
- Improved strategies for branching on general disjunctions (Q652284) (← links)
- Perfect \(0,\pm 1\) matrices (Q677152) (← links)
- (Q688912) (redirect page) (← links)
- Polyhedral study of the capacitated vehicle routing problem (Q688914) (← links)
- Ideal clutters (Q697573) (← links)
- Perfect graphs, partitionable graphs and cutsets (Q700371) (← links)
- On the safety of Gomory cut generators (Q744203) (← links)
- Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem (Q790044) (← links)
- Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem (Q790834) (← links)
- Decomposition of integer programs and of generating sets (Q826076) (← links)
- Decomposing Berge graphs containing no proper wheel, long prism or their complements (Q879162) (← links)
- A projection method for the uncapacitated facility location problem (Q918404) (← links)
- A note on the MIR closure (Q924876) (← links)
- An algorithmic framework for convex mixed integer nonlinear programs (Q951092) (← links)
- Equivalence between intersection cuts and the corner polyhedron (Q974981) (← links)
- Valid inequalities for mixed integer linear programs (Q995784) (← links)
- A feasibility pump for mixed integer nonlinear programs (Q1013979) (← links)
- Lehman matrices (Q1025999) (← links)
- Stable sets, corner polyhedra and the Chvàtal closure (Q1043240) (← links)
- An extension of matching theory (Q1057288) (← links)
- General factors of graphs (Q1085185) (← links)
- Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem. A correction (Q1086161) (← links)
- A matroid algorithm and its application to the efficient solution of two optimization problems on graphs (Q1116893) (← links)
- On the 0,1 facets of the set covering polytope (Q1122477) (← links)
- A matching problem with side conditions (Q1145707) (← links)
- (Q1166426) (redirect page) (← links)
- Packing subgraphs in a graph (Q1166429) (← links)
- Balanced cycles and holes in bipartite graphs (Q1297428) (← links)
- Ideal 0, 1 matrices (Q1322011) (← links)
- Complete multi-partite cutsets in minimal imperfect graphs (Q1322031) (← links)
- Universally signable graphs (Q1375057) (← links)
- Graphs without odd holes, parachutes or proper wheels: A generalization of Meyniel graphs and of line graphs of bipartite graphs (Q1405122) (← links)
- A class of perfect graphs containing \(P_{6}\) (Q1405124) (← links)
- Square-free perfect graphs. (Q1426100) (← links)
- On Padberg's conjecture about almost totally unimodular matrices (Q1593715) (← links)
- From estimation to optimization via shrinkage (Q1728375) (← links)
- Optimality certificates for convex minimization and Helly numbers (Q1728383) (← links)
- Split closure and intersection cuts (Q1774172) (← links)
- Disjunctive cuts for cross-sections of the second-order cone (Q1785397) (← links)
