Publications

Book Chapter

  1. D. Naddef: ``Polyhedral Theory , Branch and Cut Algorithms for the Symmetric Traveling Salesman Problem'', Chapter 2 of ``The Traveling Salesman Problem and its Variations'' (2002) Kluwert ed. pp 29-116

  2. D. Naddef and G. Rinaldi: ``Branch and Cut'', Chapitre 3 de P. Toth and D. Vigo, editors, Vehicle Routing, SIAM, 2001 Vol 20 pp 53-84

Articles in Scientific journals

  1. O. Briant and D. Naddef and G. Mounié: ``Greedy approach and multi-criteria simulated annealing for the Car Sequencing Problem'' to appear in European Journal of Operations Research.

  2. D. Naddef and G. Rinaldi : ``The symmetric Traveling Salesman Polytope: New facets from the Graphical Relaxation'' , Math of Operations Research Vol 32 February 2007, pp 233-256

  3. O. Briant and D. Naddef: ``The diversity management problem: A lagrangean approach'' Operations Research Vol. 52, No. 4, July-August 2004, pp. 515-526

  4. Denis Naddef: ``The Domino inequalities for the symmetric traveling salesman polytope'', ``The sharpest cuts'', MPS/SIAM series in Optimization (2004) pp 153-172

  5. D. Naddef and E. Wild: ``The Domino Inequalities new facets for the symmetric Traveling Salesman Polytope'', Mathematical Programing B, Vol 98 (2003) pp 223-251

  6. D. Naddef and S. Thienel: ``Efficient separation routines for the symmetric traveling salesman problem I: general tools and comb separation'', Mathematical Programming (2002), Vol 92-2 pages 237-255

  7. D. Naddef and S. Thienel: ``Efficient separation routines for the symmetric traveling salesman problem II: separating multi handle inequalities'', Mathematical Programming (2002), Vol 92-2 pages 257-285

  8. D. Naddef and Y. Pochet: ``The traveling salesman polytope revisited'', Mathematics of Operations Research (2001) Vol 26-4

  9. P. Augerat, JM Belenger, E. Benavent, A. Corberan, D. Naddef: ``Separating Capacity Constraints in the CVRP Using Tabu Search'' EJOR 106 (1998) pp 546-557

  10. D. Naddef: ``A Remark on ``Integer Linear programming Formulation for a Vehicle Routing Probem....'' European Journal of Operations Research 75 (1994).

  11. D. Naddef and G. Rinaldi : ``The Graphical Relaxation: a new framework for the Symmetric Traveling Salesman Polytope'', Math Programming Vol 58-1 (1993).

  12. J.M. Clochard and D. Naddef: ``Using Path Inequalities in a Branch and Cut Code for the Symmetric Traveling Salesman Problem'', IPCO III, Erice (1993).

  13. D. Naddef: ``The Binested inequalities for the symmetric Traveling Salesman Polytope'', Mathematics of Operations Research Vol 17-4 (1992) p 882-900.

  14. D. Naddef and G. Rinaldi : ``The crown inequalities for the Symmetric Traveling Salesman Polytope'', Math of Operations Research Vol 17, 12 (1992) 308-326

  15. J. Fonlupt and D. Naddef: ``The Traveling Salesman Problem in Graphs with excluded minors'', Mathematical Programming 53 (1992) 147-172.

  16. D. Naddef and G. Rinaldi : ``The Symmetric Traveling Salesman Polytope and its Graphical Relaxation: Composition of valid inequalities'', Mathematical Programming 51 (1991) 359-400.

  17. D.Naddef: ``Handles and Teeth in the Symmetric Traveling Salesman Polytope'', dans Polyhedral Combinatorics, DIMACS series in Discrete Mathematics and Theoretical Computer Science, W. Cook and P. Seymour éditeurs,1990.

  18. D.Naddef: ``The Hirsh Conjecture is true for 0-1 polytopes'', Mathematical Programming B 45 (1989) 109-110

  19. P. Camerini, M. Conforti and D. Naddef: ``Some easily solvable nonlinear integer programs'', Ricerca Operativa 50 (1989) 11-25.

  20. D. Naddef and C. Santos : ``One-pass batching algorithm for the one machine problem'', Discrete Applied Mathematics 21 (1988) 133-145.

  21. T.Y. Sung, H.J. Sheu, D. Naddef: ``A heuristic approach to the AIAA Design Challenge Problem'', J. of Guidance, Control and Dynamics, Vol 11, (1988) 406-411.

  22. G. Cornuejols, D. Naddef and W. Pulleyblank: ``The Traveling Salesman Problem in Graphs with 3-edge cutsets'', Journal of the A.C.M. vol 32 ní2 (1985) 383-410.

  23. G. Cornuejols, D. Naddef and J. Fonlupt : ``The Traveling Salesman Problem on a Graph and some related Integer Polyhedra'', Math Programming 33 (1985) 1-27.

  24. D. Naddef and W. Pulleyblank: ``Hamiltonicity in 0-1 Polyhedra'', Journal of Combinatorial Theory B, 37 ní1 (1984) 41-52.

  25. D. Naddef: ``Pancyclic properties of the graph of some polyhedra'', Journal of Combinatorial Theory B, 37 ní1 (1984) 10-26

  26. G. Cornuejols, D. Naddef and W. Pulleyblank:''The Traveling Salesman Problem in Halin Graphs'', Mathematical Programming, 26 (1983) 287-294.

  27. D. Naddef: ``Rank of maximum matchings in a graph'', Mathematical Programming, 22 (1982) 52-70.

  28. D. Naddef and W. Pulleyblank: ``Ear decomposition of elementary graphs and GF2 - rank of perfect matchings'', Annals of Discrete Mathematics, 16 (1982) 241-260.

  29. D. Naddef and W. Pulleyblank: ``Matchings in regular graphs'', Discrete Mathematics, 34 (1981) 283-291.

  30. D. Naddef and W. Pulleyblank: ``Hamiltonicity and Combinatorial Polyhedra'', Journal of Combinatorial Theory B, 31 (1981) 297-312.

  31. D. Naddef, N. Sbihi, M. Tchuente: ``Independence Systems with Continuous cardinality of Bases'', Discrete Mathematics, 31 (1980) 107-109.


Last update 09 Jul 2007 - Denis Naddef