default search action
Denis Naddef
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
- [j27]Michael Jünger, Thomas M. Liebling, Denis Naddef, William R. Pulleyblank, Gerhard Reinelt, Giovanni Rinaldi
, Laurence A. Wolsey:
Traces of the XII Aussois Workshop on Combinatorial Optimization. Math. Program. 124(1-2): 1-6 (2010) - [e2]Michael Jünger, Thomas M. Liebling, Denis Naddef, George L. Nemhauser, William R. Pulleyblank, Gerhard Reinelt, Giovanni Rinaldi
50 Years of Integer Programming 1958-2008 - From the Early Years to the State-of-the-Art. Springer 2010, ISBN 978-3-540-68274-5 [contents]
2000 – 2009
- 2008
- [j26]Olivier Briant
Greedy approach and multi-criteria simulated annealing for the car sequencing problem. Eur. J. Oper. Res. 191(3): 993-1003 (2008) - 2007
- [j25]Denis Naddef, Giovanni Rinaldi
The Symmetric Traveling Salesman Polytope: New Facets from the Graphical Relaxation. Math. Oper. Res. 32(1): 233-256 (2007) - 2006
- [j24]Thomas M. Liebling, Denis Naddef, Laurence A. Wolsey:
Combinatorial Optimization: Theory and Computation The Aussois Workshop 2004. Math. Program. 105(2-3): 157-160 (2006) - 2004
- [j23]Olivier Briant, Denis Naddef:
The Optimal Diversity Management Problem. Oper. Res. 52(4): 515-526 (2004) - [p2]Denis Naddef:
The Domino Inequalities for the Symmetric Traveling Salesman Problem. The Sharpest Cut 2004: 153-172 - 2003
- [j22]Thomas M. Liebling, Denis Naddef, Laurence A. Wolsey:
The Aussois 2000 workshop in combinatorial optimization introduction. Math. Program. 94(2-3): 189-191 (2003) - [j21]Denis Naddef, Emmanuel Wild:
The domino inequalities: facets for the symmetric traveling salesman polytope. Math. Program. 98(1-3): 223-251 (2003) - 2002
- [j20]Denis Naddef, Stefan Thienel:
Efficient separation routines for the symmetric traveling salesman problem I: general tools and comb separation. Math. Program. 92(2): 237-255 (2002) - [j19]Denis Naddef, Stefan Thienel:
Efficient separation routines for the symmetric traveling salesman problem II: separating multi handle inequalities. Math. Program. 92(2): 257-283 (2002) - [p1]Denis Naddef, Giovanni Rinaldi:
Branch-And-Cut Algorithms for the Capacitated VRP. The Vehicle Routing Problem 2002: 53-84 - 2001
- [j18]Denis Naddef, Yves Pochet:
The Symmetric Traveling Salesman Polytope Revisited. Math. Oper. Res. 26(4): 700-722 (2001) - [e1]Michael Jünger, Denis Naddef:
Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School, Schloß Dagstuhl, Germany, 15-19 May 2000]. Lecture Notes in Computer Science 2241, Springer 2001, ISBN 3-540-42877-1 [contents]
1990 – 1999
- 1998
- [j17]P. Augerat, José-Manuel Belenguer, Enrique Benavent, Ángel Corberán
Separating capacity constraints in the CVRP using tabu search. Eur. J. Oper. Res. 106(2-3): 546-557 (1998) - 1993
- [j16]Denis Naddef, Giovanni Rinaldi
The graphical relaxation: A new framework for the Symmetric Traveling Salesman Polytope. Math. Program. 58: 53-88 (1993) - [c2]Jean-Maurice Clochard, Denis Naddef:
Using path inequalities in a branch and cut code for the symmetric traveling salesman problem. IPCO 1993: 291-311 - 1992
- [j15]Denis Naddef, Giovanni Rinaldi
The Crown Inequalities for the Symmetric Traveling Salesman Polytope. Math. Oper. Res. 17(2): 308-326 (1992) - [j14]Denis Naddef:
The Binested Inequalities for the Symmetric Traveling Salesman Polytope. Math. Oper. Res. 17(4): 882-900 (1992) - [j13]Jean Fonlupt, Denis Naddef:
The traveling salesman problem in graphs with some excluded minors. Math. Program. 53: 147-172 (1992) - 1991
- [j12]Denis Naddef, Giovanni Rinaldi
The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities. Math. Program. 51: 359-400 (1991) - 1990
- [c1]Denis Naddef:
Handles and Teeth in the Symmetric Traveling Salesman Problems. Polyhedral Combinatorics 1990: 61-74
1980 – 1989
- 1989
- [j11]Denis Naddef:
The hirsch conjecture is true for (0, 1)-polytopes. Math. Program. 45(1-3): 109-110 (1989) - 1988
- [j10]Denis Naddef, Cipriano Santos:
One-pass batching algorithms for the one-machine problem. Discret. Appl. Math. 21(2): 133-145 (1988) - 1985
- [j9]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) - [j8]Gérard Cornuéjols, Jean Fonlupt, Denis Naddef:
The traveling salesman problem on a graph and some related integer polyhedra. Math. Program. 33(1): 1-27 (1985) - 1984
- [j7]Denis Naddef:
Pancyclic properties of the graph of some 0-1 polyhedra. J. Comb. Theory B 37(1): 10-26 (1984) - [j6]Denis Naddef, William R. Pulleyblank:
Hamiltonicity in (0-1)-polyhedra. J. Comb. Theory B 37(1): 41-52 (1984) - 1983
- [b2]Denis Naddef:
Polyèdres et structures combinatoires. Joseph Fourier University, Grenoble, France, 1983 - [j5]Gérard Cornuéjols, Denis Naddef, William R. Pulleyblank:
Halin graphs and the travelling salesman problem. Math. Program. 26(3): 287-294 (1983) - 1982
- [j4]Denis Naddef:
Rank of maximum matchings in a graph. Math. Program. 22(1): 52-70 (1982) - 1981
- [j3]Denis Naddef, William R. Pulleyblank:
Matchings in regular graphs. Discret. Math. 34(3): 283-291 (1981) - [j2]Denis Naddef, William R. Pulleyblank:
Hamiltonicity and combinatorial polyhedra. J. Comb. Theory B 31(3): 297-312 (1981) - 1980
- [j1]Denis Naddef, Najiba Sbihi, Maurice Tchuenté:
Independence systems with continuous cardinality of bases. Discret. Math. 31(1): 107-109 (1980)
1970 – 1979
- 1978
- [b1]Denis Naddef:
Rang des couplages maximums d'un graphe. Joseph Fourier University, Grenoble, France, 1978
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: