The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Denis Naddef: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jean-Maurice Clochard, Denis Naddef
    Using path inequalities in a branch and cut code for the symmetric traveling salesman problem. [Citation Graph (0, 0)][DBLP]
    IPCO, 1993, pp:291-311 [Conf]
  2. 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]
  3. Denis Naddef
    Pancyclic properties of the graph of some 0-1 polyhedra. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1984, v:37, n:1, pp:10-26 [Journal]
  4. Denis Naddef, William R. Pulleyblank
    Hamiltonicity and combinatorial polyhedra. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1981, v:31, n:3, pp:297-312 [Journal]
  5. Denis Naddef, William R. Pulleyblank
    Hamiltonicity in (0-1)-polyhedra. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1984, v:37, n:1, pp:41-52 [Journal]
  6. Denis Naddef, Yves Pochet
    The Symmetric Traveling Salesman Polytope Revisited. [Citation Graph (0, 0)][DBLP]
    Math. Oper. Res., 2001, v:26, n:4, pp:700-722 [Journal]
  7. Jean Fonlupt, Denis Naddef
    The traveling salesman problem in graphs with some excluded minors. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:53, n:, pp:147-172 [Journal]
  8. Thomas M. Liebling, Denis Naddef, Laurence A. Wolsey
    Combinatorial Optimization: Theory and Computation The Aussois Workshop 2004. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2006, v:105, n:2-3, pp:157-160 [Journal]
  9. Denis Naddef, Giovanni Rinaldi
    The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:51, n:, pp:359-400 [Journal]
  10. Denis Naddef, Giovanni Rinaldi
    The graphical relaxation: A new framework for the Symmetric Traveling Salesman Polytope. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:58, n:, pp:53-88 [Journal]
  11. Denis Naddef, Najiba Sbihi, Maurice Tchuente
    Independence systems with continuous cardinality of bases. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1980, v:31, n:1, pp:107-109 [Journal]
  12. Denis Naddef, William R. Pulleyblank
    Matchings in regular graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:34, n:3, pp:283-291 [Journal]

  13. One-pass batching algorithms for the one-machine problem. [Citation Graph (, )][DBLP]


Search in 0.098secs, Finished in 0.099secs
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