The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Gérard Cornuéjols: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Gérard Cornuéjols, Regina Urbaniak, Robert Weismantel, Laurence A. Wolsey
    Decomposition of Integer Programs and of Generating Sets. [Citation Graph (0, 0)][DBLP]
    ESA, 1997, pp:92-102 [Conf]
  2. Michele Conforti, Gérard Cornuéjols
    A Class of Logic Problems Solvable by Linear Programming [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:670-675 [Conf]
  3. Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic
    Finding an Even Hole in a Graph. [Citation Graph (0, 0)][DBLP]
    FOCS, 1997, pp:480-485 [Conf]
  4. Gérard Cornuéjols, Xinming Liu, Kristina Vuskovic
    A Polynomial Algorithm for Recognizing Perfect Graphs. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:20-27 [Conf]
  5. Sebastián Ceria, Gérard Cornuéjols, Milind Dawande
    Combining and Strengthening Gomory Cuts. [Citation Graph (0, 0)][DBLP]
    IPCO, 1995, pp:438-451 [Conf]
  6. Kent Andersen, Gérard Cornuéjols, Yanjun Li
    Split Closure and Intersection Cuts. [Citation Graph (0, 0)][DBLP]
    IPCO, 2002, pp:127-144 [Conf]
  7. Michele Conforti, Gérard Cornuéjols
    A Decomposition Theorem for Balanced Matrices. [Citation Graph (0, 0)][DBLP]
    IPCO, 1990, pp:147-169 [Conf]
  8. Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic
    A Mickey-Mouse Decomposition Theorem. [Citation Graph (0, 0)][DBLP]
    IPCO, 1995, pp:321-328 [Conf]
  9. Gérard Cornuéjols, Milind Dawande
    A Class of Hard Small 0-1 Programs. [Citation Graph (0, 0)][DBLP]
    IPCO, 1998, pp:284-293 [Conf]
  10. Gérard Cornuéjols, Bertrand Guenin, François Margot
    The Packing Property. [Citation Graph (0, 0)][DBLP]
    IPCO, 1998, pp:1-8 [Conf]
  11. Gérard Cornuéjols, Yanjun Li
    On the Rank of Mixed 0, 1 Polyhedra. [Citation Graph (0, 0)][DBLP]
    IPCO, 2001, pp:71-77 [Conf]
  12. Egon Balas, Sebastián Ceria, Gérard Cornuéjols
    Solving Mixed 0-1 Programs by a Lift-and-Project Method. [Citation Graph (0, 0)][DBLP]
    SODA, 1993, pp:232-242 [Conf]
  13. Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic
    Recognizing Balanced 0, +/- Matrices. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:103-111 [Conf]
  14. Michele Conforti, Gérard Cornuéjols, Grigor Gasparyan, Kristina Vuskovic
    Perfect Graphs, Partitionable Graphs and Cutsets. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2002, v:22, n:1, pp:19-33 [Journal]
  15. Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic
    Perfect Matchings in Balanced Hypergraphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1996, v:16, n:3, pp:325-329 [Journal]
  16. Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic
    Universally Signable Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1997, v:17, n:1, pp:67-77 [Journal]
  17. Gérard Cornuéjols, William R. Pulleyblank
    Critical graphs, matching and tours or a hierarchy of relaxations for the traveling salesman problem. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1983, v:3, n:1, pp:35-52 [Journal]
  18. Maria Chudnovsky, Gérard Cornuéjols, Xinming Liu, Paul D. Seymour, Kristina Vuskovic
    Recognizing Berge Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2005, v:25, n:2, pp:143-186 [Journal]
  19. Michele Conforti, Gérard Cornuéjols, M. R. Rao
    Decomposition of Wheel-and-parachute-free Balanced Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:62, n:1-3, pp:103-117 [Journal]
  20. Michele Conforti, Gérard Cornuéjols, Kristina Vuskovic
    Decomposition of odd-hole-free graphs by double star cutsets and 2-joins. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:141, n:1-3, pp:41-91 [Journal]
  21. Gérard Cornuéjols, Bertrand Guenin
    Ideal clutters. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:123, n:1-3, pp:303-338 [Journal]
  22. Gérard Cornuéjols, William R. Pulleyblank
    Foreword. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:89, n:1-3, pp:1-2 [Journal]
  23. Gérard Cornuéjols, Bertrand Guenin
    On dijoins. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:243, n:1-3, pp:213-216 [Journal]
  24. Michele Conforti, Gérard Cornuéjols, Kristina Vuskovic
    Balanced matrices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:19-20, pp:2411-2437 [Journal]
  25. Gérard Cornuéjols, Yanjun Li, Dieter Vandenbussche
    K-Cuts: A Variation of Gomory Mixed Integer Cuts from the LP Tableau. [Citation Graph (0, 0)][DBLP]
    INFORMS Journal on Computing, 2003, v:15, n:4, pp:385-396 [Journal]
  26. Gérard Cornuéjols, Miroslav Karamanov, Yanjun Li
    Early Estimates of the Size of Branch-and-Bound Trees. [Citation Graph (0, 0)][DBLP]
    INFORMS Journal on Computing, 2006, v:18, n:1, pp:86-96 [Journal]
  27. Michele Conforti, Gérard Cornuéjols
    A Class of Logic Problems Solvable by Linear Programming. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1995, v:42, n:5, pp:1107-1113 [Journal]
  28. Gérard Cornuéjols, Denis Naddef, William R. Pulleyblank
    The Traveling Salesman Problem in Graphs with 3-Edge Cutsets [Citation Graph (0, 0)][DBLP]
    J. ACM, 1985, v:32, n:2, pp:383-410 [Journal]
  29. 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. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:87, n:2, pp:300-330 [Journal]
  30. Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic
    Balanced 0-1 Matrices I. Decomposition. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2001, v:81, n:2, pp:243-274 [Journal]
  31. Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic
    Balanced 0-1 Matrices II. Recognition Algorithm. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2001, v:81, n:2, pp:275-306 [Journal]
  32. Michele Conforti, Gérard Cornuéjols, M. R. Rao
    Decomposition of Balanced Matrices. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1999, v:77, n:2, pp:292-406 [Journal]
  33. Michele Conforti, Gérard Cornuéjols, Kristina Vuskovic
    Square-free perfect graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2004, v:90, n:2, pp:257-307 [Journal]
  34. Gérard Cornuéjols
    General factors of graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1988, v:45, n:2, pp:185-198 [Journal]
  35. Gérard Cornuéjols, David Hartvigsen
    An extension of matching theory. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1986, v:40, n:3, pp:285-296 [Journal]
  36. Gérard Cornuéjols, Xinming Liu
    A class of perfect graphs containing P6. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:87, n:2, pp:331-347 [Journal]
  37. Gérard Cornuéjols, Beth Novick
    Ideal 0, 1 Matrices. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1994, v:60, n:1, pp:145-157 [Journal]
  38. Gérard Cornuéjols, Bruce A. Reed
    Complete Multi-partite Cutsets in Minimal Imperfect Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1993, v:59, n:2, pp:191-198 [Journal]
  39. Kent Andersen, Gérard Cornuéjols, Yanjun Li
    Split closure and intersection cuts. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2005, v:102, n:3, pp:457-493 [Journal]
  40. Egon Balas, Sebastián Ceria, Gérard Cornuéjols
    A lift-and-project cutting plane algorithm for mixed 0-1 programs. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:58, n:, pp:295-324 [Journal]
  41. Michele Conforti, Gérard Cornuéjols
    Balanced 0, +-1-matrixces, bicoloring and total dual integrality. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1995, v:71, n:, pp:249-258 [Journal]
  42. Andrew R. Conn, Gérard Cornuéjols
    A Projection Method for the Uncapacitated Facility Location Problem. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1990, v:46, n:, pp:273-298 [Journal]
  43. Gérard Cornuéjols, Farid Harche
    Polyhedral study of the capacitated vehicle routing problem. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:60, n:, pp:21-52 [Journal]
  44. Gérard Cornuéjols, Claude Lemaréchal
    A convex-analysis perspective on disjunctive cuts. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2006, v:106, n:3, pp:567-586 [Journal]
  45. Gérard Cornuéjols, Yanjun Li
    Elementary closures for integer programs. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2001, v:28, n:1, pp:1-8 [Journal]
  46. Gérard Cornuéjols, Luis F. Zuluaga
    On Padberg's conjecture about almost totally unimodular matrices. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2000, v:27, n:3, pp:97-99 [Journal]
  47. Michele Conforti, Gérard Cornuéjols, Xinming Liu, Kristina Vuskovic, Giacomo Zambelli
    Odd Hole Recognition in Graphs of Bounded Clique Size. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2006, v:20, n:1, pp:42-48 [Journal]
  48. Gérard Cornuéjols, Bertrand Guenin
    Ideal Binary Clutters, Connectivity, and a Conjecture of Seymour. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2002, v:15, n:3, pp:329-352 [Journal]
  49. Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli
    Decomposing Berge Graphs Containing No Proper Wheel, Long Prism Or Their Complements. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2006, v:26, n:5, pp:533-558 [Journal]
  50. Gérard Cornuéjols, William H. Cunningham
    Compositions for perfect graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:55, n:3, pp:245-254 [Journal]
  51. Michele Conforti, Gérard Cornuéjols, Kristina Vuskovic
    Balanced cycles and holes in bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:199, n:1-3, pp:27-33 [Journal]

  52. On Lifting Integer Variables in Minimal Inequalities. [Citation Graph (, )][DBLP]


  53. On the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints. [Citation Graph (, )][DBLP]


  54. On the relative strength of split, triangle and quadrilateral cuts. [Citation Graph (, )][DBLP]


  55. Improved Strategies for Branching on General Disjunctions. [Citation Graph (, )][DBLP]


  56. Extended formulations in combinatorial optimization. [Citation Graph (, )][DBLP]


Search in 0.032secs, Finished in 0.034secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002