Denis Naddef

From MaRDI portal


List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Traces of the XII Aussois Workshop on combinatorial optimization
Mathematical Programming. Series A. Series B
2010-09-16Paper
The Optimal Diversity Management Problem
Operations Research
2009-07-14Paper
Greedy approach and multi-criteria simulated annealing for the car sequencing problem
European Journal of Operational Research
2008-07-10Paper
The Symmetric Traveling Salesman Polytope: New Facets from the Graphical Relaxation
Mathematics of Operations Research
2008-05-27Paper
Combinatorial optimization: Theory and computation. The Aussois Workshop 2004. Introduction
Mathematical Programming. Series A. Series B
2006-01-13Paper
The Symmetric Traveling Salesman Polytope Revisited
Mathematics of Operations Research
2005-11-11Paper
scientific article; zbMATH DE number 2196282 (Why is no real title available?)
 
2005-08-22Paper
scientific article; zbMATH DE number 2064405 (Why is no real title available?)
 
2004-05-18Paper
The domino inequalities: facets for the symmetric traveling salesman polytope
Mathematical Programming. Series A. Series B
2004-03-11Paper
The Aussois 2000 workshop in combinatorial optimization. Introduction
Mathematical Programming. Series A. Series B
2003-10-29Paper
Efficient separation routines for the symmetric traveling salesman problem. II: Separating multi handle inequalities.
Mathematical Programming. Series A. Series B
2002-09-15Paper
Efficient separation routines for the symmetric traveling salesman problem. I: General tools and comb separation
Mathematical Programming. Series A. Series B
2002-08-20Paper
Separating capacity constraints in the CVRP using tabu search
European Journal of Operational Research
2002-08-18Paper
scientific article; zbMATH DE number 1749222 (Why is no real title available?)
 
2002-01-01Paper
scientific article; zbMATH DE number 1263277 (Why is no real title available?)
 
1999-11-02Paper
A remark on ``Integer linear programming formulation for a vehicle routing problem by N. R. Achutan and L. Caccetta, or how to use the Clark \(\&\) Wright savings to write such integer linear programming formulations
European Journal of Operational Research
1994-10-17Paper
The graphical relaxation: A new framework for the symmetric traveling salesman polytope
Mathematical Programming. Series A. Series B
1993-06-29Paper
The Binested Inequalities for the Symmetric Traveling Salesman Polytope
Mathematics of Operations Research
1993-03-01Paper
The Crown Inequalities for the Symmetric Traveling Salesman Polytope
Mathematics of Operations Research
1993-01-16Paper
The traveling salesman problem in graphs with some excluded minors
Mathematical Programming. Series A. Series B
1992-06-28Paper
The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities
Mathematical Programming. Series A. Series B
1992-06-27Paper
scientific article; zbMATH DE number 16722 (Why is no real title available?)
 
1992-06-26Paper
The Hirsch conjecture is true for (0,1)-polytopes
Mathematical Programming. Series A. Series B
1989-01-01Paper
One-pass batching algorithms for the one-machine problem
Discrete Applied Mathematics
1988-01-01Paper
Heuristic approach to the artificial intelligence design challenge
Journal of Guidance, Control, and Dynamics
1988-01-01Paper
The traveling salesman problem on a graph and some related integer polyhedra
Mathematical Programming
1985-01-01Paper
The traveling salesman problem in graphs with 3-edge cutsets
Journal of the ACM
1985-01-01Paper
Hamiltonicity in (0-1)-polyhedra
Journal of Combinatorial Theory. Series B
1984-01-01Paper
Pancyclic properties of the graph of some 0-1 polyhedra
Journal of Combinatorial Theory. Series B
1984-01-01Paper
scientific article; zbMATH DE number 3849282 (Why is no real title available?)
 
1984-01-01Paper
Halin graphs and the travelling salesman problem
Mathematical Programming
1983-01-01Paper
Ear Decompositions of Elementary Graphs and GF2-rank of Perfect Matchings
North-Holland Mathematics Studies
1982-01-01Paper
Rank of maximum matchings in a graph
Mathematical Programming
1982-01-01Paper
Hamiltonicity and combinatorial polyhedra
Journal of Combinatorial Theory. Series B
1981-01-01Paper
Matchings in regular graphs
Discrete Mathematics
1981-01-01Paper
Independence systems with continuous cardinality of bases
Discrete Mathematics
1980-01-01Paper
scientific article; zbMATH DE number 3654137 (Why is no real title available?)
 
1978-01-01Paper


Research outcomes over time


This page was built for person: Denis Naddef