2009 | ||
---|---|---|
61 | EE | Amitabh Basu, Pierre Bonami, Gérard Cornuéjols, François Margot: On the relative strength of split, triangle and quadrilateral cuts. SODA 2009: 1220-1229 |
2008 | ||
60 | EE | Gérard Cornuéjols, François Margot: On the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints. LATIN 2008: 317-328 |
59 | EE | Pierre Bonami, Lorenz T. Biegler, Andrew R. Conn, Gérard Cornuéjols, Ignacio E. Grossmann, Carl D. Laird, Jon Lee, Andrea Lodi, François Margot, Nicolas Sawaya, Andreas Wächter: An algorithmic framework for convex mixed integer nonlinear programs. Discrete Optimization 5(2): 186-204 (2008) |
58 | EE | Gérard Cornuéjols: Valid inequalities for mixed integer linear programs. Math. Program. 112(1): 3-44 (2008) |
57 | EE | Pierre Bonami, Gérard Cornuéjols, Sanjeeb Dash, Matteo Fischetti, Andrea Lodi: Projected Chvátal-Gomory cuts for mixed integer linear programs. Math. Program. 113(2): 241-257 (2008) |
56 | EE | Pierre Bonami, Gérard Cornuéjols: A note on the MIR closure. Oper. Res. Lett. 36(1): 4-6 (2008) |
55 | EE | Gérard Cornuéjols: Review of combinatorial optimization: packing and covering. SIGACT News 39(3): 16-18 (2008) |
2007 | ||
54 | EE | Gérard Cornuéjols: Revival of the Gomory cuts in the 1990's. Annals OR 149(1): 63-66 (2007) |
2006 | ||
53 | EE | Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli: Decomposing Berge Graphs Containing No Proper Wheel, Long Prism Or Their Complements. Combinatorica 26(5): 533-558 (2006) |
52 | EE | Michele Conforti, Gérard Cornuéjols, Kristina Vuskovic: Balanced matrices. Discrete Mathematics 306(19-20): 2411-2437 (2006) |
51 | EE | Gérard Cornuéjols, Miroslav Karamanov, Yanjun Li: Early Estimates of the Size of Branch-and-Bound Trees. INFORMS Journal on Computing 18(1): 86-96 (2006) |
50 | EE | Gérard Cornuéjols, Claude Lemaréchal: A convex-analysis perspective on disjunctive cuts. Math. Program. 106(3): 567-586 (2006) |
49 | EE | Michele Conforti, Gérard Cornuéjols, Xinming Liu, Kristina Vuskovic, Giacomo Zambelli: Odd Hole Recognition in Graphs of Bounded Clique Size. SIAM J. Discrete Math. 20(1): 42-48 (2006) |
2005 | ||
48 | EE | Maria Chudnovsky, Gérard Cornuéjols, Xinming Liu, Paul D. Seymour, Kristina Vuskovic: Recognizing Berge Graphs. Combinatorica 25(2): 143-186 (2005) |
47 | EE | Kent Andersen, Gérard Cornuéjols, Yanjun Li: Split closure and intersection cuts. Math. Program. 102(3): 457-493 (2005) |
2004 | ||
46 | EE | Michele Conforti, Gérard Cornuéjols, Kristina Vuskovic: Decomposition of odd-hole-free graphs by double star cutsets and 2-joins. Discrete Applied Mathematics 141(1-3): 41-91 (2004) |
45 | EE | Michele Conforti, Gérard Cornuéjols, Kristina Vuskovic: Square-free perfect graphs. J. Comb. Theory, Ser. B 90(2): 257-307 (2004) |
2003 | ||
44 | EE | Gérard Cornuéjols, Xinming Liu, Kristina Vuskovic: A Polynomial Algorithm for Recognizing Perfect Graphs. FOCS 2003: 20-27 |
43 | EE | Gérard Cornuéjols, Yanjun Li, Dieter Vandenbussche: K-Cuts: A Variation of Gomory Mixed Integer Cuts from the LP Tableau. INFORMS Journal on Computing 15(4): 385-396 (2003) |
42 | EE | Michele Conforti, Gérard Cornuéjols: Graphs without odd holes, parachutes or proper wheels: a generalization of Meyniel graphs and of line graphs of bipartite graphs. J. Comb. Theory, Ser. B 87(2): 300-330 (2003) |
41 | EE | Gérard Cornuéjols, Xinming Liu: A class of perfect graphs containing P6. J. Comb. Theory, Ser. B 87(2): 331-347 (2003) |
2002 | ||
40 | EE | Kent Andersen, Gérard Cornuéjols, Yanjun Li: Split Closure and Intersection Cuts. IPCO 2002: 127-144 |
39 | EE | Michele Conforti, Gérard Cornuéjols, Grigor Gasparyan, Kristina Vuskovic: Perfect Graphs, Partitionable Graphs and Cutsets. Combinatorica 22(1): 19-33 (2002) |
38 | Gérard Cornuéjols, Bertrand Guenin: Ideal clutters. Discrete Applied Mathematics 123(1-3): 303-338 (2002) | |
37 | EE | Gérard Cornuéjols, Bertrand Guenin: On dijoins. Discrete Mathematics 243(1-3): 213-216 (2002) |
36 | EE | Gérard Cornuéjols, Bertrand Guenin: Ideal Binary Clutters, Connectivity, and a Conjecture of Seymour. SIAM J. Discrete Math. 15(3): 329-352 (2002) |
2001 | ||
35 | EE | Gérard Cornuéjols, Yanjun Li: On the Rank of Mixed 0, 1 Polyhedra. IPCO 2001: 71-77 |
34 | EE | Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic: Balanced 0-1 Matrices I. Decomposition. J. Comb. Theory, Ser. B 81(2): 243-274 (2001) |
33 | EE | Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic: Balanced 0-1 Matrices II. Recognition Algorithm. J. Comb. Theory, Ser. B 81(2): 275-306 (2001) |
32 | EE | Gérard Cornuéjols, Yanjun Li: Elementary closures for integer programs. Oper. Res. Lett. 28(1): 1-8 (2001) |
2000 | ||
31 | EE | Gérard Cornuéjols, Luis F. Zuluaga: On Padberg's conjecture about almost totally unimodular matrices. Oper. Res. Lett. 27(3): 97-99 (2000) |
1999 | ||
30 | Gérard Cornuéjols, Rainer E. Burkard, Gerhard J. Woeginger: Integer Programming and Combinatorial Optimization, 7th International IPCO Conference, Graz, Austria, June 9-11, 1999, Proceedings Springer 1999 | |
29 | EE | Michele Conforti, Gérard Cornuéjols, Kristina Vuskovic: Balanced cycles and holes in bipartite graphs. Discrete Mathematics 199(1-3): 27-33 (1999) |
28 | EE | Michele Conforti, Gérard Cornuéjols, M. R. Rao: Decomposition of Balanced Matrices. J. Comb. Theory, Ser. B 77(2): 292-406 (1999) |
1998 | ||
27 | EE | Gérard Cornuéjols, Bertrand Guenin, François Margot: The Packing Property. IPCO 1998: 1-8 |
26 | EE | Gérard Cornuéjols, Milind Dawande: A Class of Hard Small 0-1 Programs. IPCO 1998: 284-293 |
25 | EE | Gérard Cornuéjols, William R. Pulleyblank: Foreword. Discrete Applied Mathematics 89(1-3): 1-2 (1998) |
1997 | ||
24 | Gérard Cornuéjols, Regina Urbaniak, Robert Weismantel, Laurence A. Wolsey: Decomposition of Integer Programs and of Generating Sets. ESA 1997: 92-102 | |
23 | EE | Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic: Finding an Even Hole in a Graph. FOCS 1997: 480-485 |
22 | Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic: Universally Signable Graphs. Combinatorica 17(1): 67-77 (1997) | |
1996 | ||
21 | Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic: Perfect Matchings in Balanced Hypergraphs. Combinatorica 16(3): 325-329 (1996) | |
1995 | ||
20 | Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic: A Mickey-Mouse Decomposition Theorem. IPCO 1995: 321-328 | |
19 | Sebastián Ceria, Gérard Cornuéjols, Milind Dawande: Combining and Strengthening Gomory Cuts. IPCO 1995: 438-451 | |
18 | EE | Michele Conforti, Gérard Cornuéjols, M. R. Rao: Decomposition of Wheel-and-parachute-free Balanced Bipartite Graphs. Discrete Applied Mathematics 62(1-3): 103-117 (1995) |
17 | EE | Michele Conforti, Gérard Cornuéjols: A Class of Logic Problems Solvable by Linear Programming. J. ACM 42(5): 1107-1113 (1995) |
16 | Michele Conforti, Gérard Cornuéjols: Balanced 0, +-1-matrixces, bicoloring and total dual integrality. Math. Program. 71: 249-258 (1995) | |
1994 | ||
15 | Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic: Recognizing Balanced 0, ± Matrices. SODA 1994: 103-111 | |
14 | EE | Gérard Cornuéjols, Beth Novick: Ideal 0, 1 Matrices. J. Comb. Theory, Ser. B 60(1): 145-157 (1994) |
1993 | ||
13 | Egon Balas, Sebastián Ceria, Gérard Cornuéjols: Solving Mixed 0-1 Programs by a Lift-and-Project Method. SODA 1993: 232-242 | |
12 | EE | Gérard Cornuéjols, Bruce A. Reed: Complete Multi-partite Cutsets in Minimal Imperfect Graphs. J. Comb. Theory, Ser. B 59(2): 191-198 (1993) |
11 | Egon Balas, Sebastián Ceria, Gérard Cornuéjols: A lift-and-project cutting plane algorithm for mixed 0-1 programs. Math. Program. 58: 295-324 (1993) | |
10 | Gérard Cornuéjols, Farid Harche: Polyhedral study of the capacitated vehicle routing problem. Math. Program. 60: 21-52 (1993) | |
1992 | ||
9 | Egon Balas, Gérard Cornuéjols, Ravi Kannan: Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, Pittsburgh, PA, May 1992 Carnegie Mellon University 1992 | |
8 | Michele Conforti, Gérard Cornuéjols: A Class of Logic Problems Solvable by Linear Programming FOCS 1992: 670-675 | |
1990 | ||
7 | Michele Conforti, Gérard Cornuéjols: A Decomposition Theorem for Balanced Matrices. IPCO 1990: 147-169 | |
6 | Andrew R. Conn, Gérard Cornuéjols: A Projection Method for the Uncapacitated Facility Location Problem. Math. Program. 46: 273-298 (1990) | |
1988 | ||
5 | EE | Gérard Cornuéjols: General factors of graphs. J. Comb. Theory, Ser. B 45(2): 185-198 (1988) |
1986 | ||
4 | EE | Gérard Cornuéjols, David Hartvigsen: An extension of matching theory. J. Comb. Theory, Ser. B 40(3): 285-296 (1986) |
1985 | ||
3 | EE | Gérard Cornuéjols, William H. Cunningham: Compositions for perfect graphs. Discrete Mathematics 55(3): 245-254 (1985) |
2 | EE | Gérard Cornuéjols, Denis Naddef, William R. Pulleyblank: The Traveling Salesman Problem in Graphs with 3-Edge Cutsets J. ACM 32(2): 383-410 (1985) |
1983 | ||
1 | Gérard Cornuéjols, William R. Pulleyblank: Critical graphs, matching and tours or a hierarchy of relaxations for the traveling salesman problem. Combinatorica 3(1): 35-52 (1983) |