Filtrer vos résultats
- 76
- 4
- 48
- 23
- 6
- 3
- 58
- 34
- 11
- 2
- 2
- 1
- 1
- 3
- 3
- 2
- 3
- 7
- 3
- 1
- 7
- 4
- 9
- 2
- 8
- 6
- 6
- 7
- 6
- 1
- 1
- 74
- 6
- 77
- 6
- 3
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 80
- 6
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
80 résultats
Paintshop, odd cycles and necklace splittingDiscrete Applied Mathematics, 2009, 157 (4), pp.780-793. ⟨10.1016/j.dam.2008.06.017⟩
Article dans une revue
istex
hal-00835238v1
|
|||
Sur un problème de diversitéConférence scientifique conjointe en Recherche Opérationnelle et Aide à la Décision - FRANCORO V / ROADEF/, Feb 2007, Grenoble, France
Communication dans un congrès
hal-00380232v1
|
|||
Batch Processing with Interval Graph Compatibilities between tasks7th Triennial Conference of the International Federation of Operational Research Societies, Jul 2005, Hawaï, United States. pp25
Communication dans un congrès
hal-00373014v1
|
|||
A new co-NP characterization of SeymourAussois workshop on Combinatorial Optimization, Jan 2011, Aussois, France
Communication dans un congrès
hal-00688019v1
|
|||
Au carrefour polyédral du postier et du voyageur de commerceJournées Polyedres et Optimisation Combinatoire, 2013, Clermont Ferrand, France
Communication dans un congrès
hal-01027493v1
|
|||
The Collapse of the Virtual Private Network PyramidColloque Optimisation Combinatoire, 2011, Oberwolfach, Germany
Communication dans un congrès
hal-01026408v1
|
|||
Equivalence Classes of Cyclic OrdersCombinatorial Optimization 9, Mar 2005, Aussois, France
Communication dans un congrès
hal-00384233v1
|
|||
A Berge-Keeping operation for graphsDiscrete Mathematics, 2006, 306, special issue "creation and recreation : a tribute to the memory of Claude Berge" (19-20), pp.2582-2592
Article dans une revue
hal-00360202v1
|
|||
Diversity, Optimization and ExtremaColloque at the occasion of the 50th anniversary of Waterloo University and the 40th anniversary of the Department of Combinatorics and Optimization, Jun 2007, Waterloo, Canada
Communication dans un congrès
hal-00396250v1
|
|||
Path Partitions, Cycle Covers, Max k-chromatic subgraphsGraph Theory, Computational Intelligence and thought, at the occasion of the 60 years of M. Golumbic, Sep 2008, Haifa, Israel
Communication dans un congrès
hal-00396244v1
|
|||
An optimal bin-packing algorithm to minimize the number of washing cycles in a hostipal sterilization service.International Conference on Operational Research Applied to Health Services, (ORAHS'11), Jul 2011, Cardiff, United Kingdom
Communication dans un congrès
hal-00677269v1
|
|||
The Salesman's Improved Paths: a 3/2 + 1/34 ApproximationFlexible Network Design, Jun 2016, Amsterdam, Netherlands. ⟨10.1109/FOCS.2016.21⟩
Communication dans un congrès
hal-01420379v1
|
|||
From Pyramids to virtual private Network PolyhedraColloque Optimisation Combinatoire, Oct 2011, Oberwolfach, Germany
Communication dans un congrès
hal-00688373v1
|
|||
Compact Extensions for MultiflowsFirst Cargese Workshop in Combinatorial Optimization, Sep 2011, Cargèse, France
Communication dans un congrès
hal-00688196v1
|
|||
Eight-Fifth approximation for TSP paths, Integer Programming and Combinatorial Optimization (IPCO) 16LNCS 7801, 2013, pp.362 - 374
Article dans une revue
hal-00972007v1
|
|||
Connected Joins in GraphsInternational Conference on Integer Programming and Combinatorial Optimization (IPCO), Jun 2001, Utrecht, Netherlands. pp.383-395
Communication dans un congrès
hal-00427193v1
|
|||
Alternatives for testingTotal Dual IntegralityMathematical Programming, 2012, 1-2 (132), pp.57 - 78
Article dans une revue
hal-00688012v1
|
|||
|
|
The Salesman's Improved Paths through ForestsJournal of the ACM (JACM), 2019, 66 (4), pp.1 - 16. ⟨10.1145/3326123⟩
Article dans une revue
hal-03002862v1
|
||
|
|
The Salesman's Improved Paths: 3/2+1/34 Integrality Gap and Approximation RatioJournal of the ACM (JACM), 2018
Article dans une revue
hal-01910981v1
|
||
|
|
Shorter Tours by Nicer Ears: 7/5-approximation for graphic TSP, 3/2 for the path version, and 4/3 for two-edge-connected subgraphsCombinatorica, 2014, 34 (5), pp.597-629. ⟨10.1007/s00493-014-2960-3⟩
Article dans une revue
hal-01592748v1
|
||
Excluded Minov Characterization of Seymour graphsInteger Programming and Combinatorial Optimization (IPCO), Jun 2011, IBM Yorktown Heights, United States
Communication dans un congrès
hal-00688249v1
|
|||
Parcours et Coupes" Graphes et applications - vol.2 ", édité par JC Fournier, Hermes Lavoisier, chap 1, 2007
Chapitre d'ouvrage
hal-00366985v1
|
|||
Le charme discret des mathématiquesImages des Mathématiques, 2006, pp.131-140
Article dans une revue
hal-00364598v1
|
|||
Hilbert bases and their OccurrencesBellairs Workshop on Integer Programming, Apr 2008, Holetown, Barbados
Communication dans un congrès
hal-00396248v1
|
|||
|
|
Multiflow Feasibility : an Annotated TableauResearch Trends in Combinatorial Optimization, Springer, pp.261-283, 2009
Chapitre d'ouvrage
hal-00313948v1
|
||
Travelling Salesmen on Bounded Degree TrailsRouting and Network Design Workshop, Sep 2015, Bonn, Germany
Communication dans un congrès
hal-01420333v1
|
|||
Path Partitions, Cycle Covers and Integer DecompositionSymposium in honor of the 60th birthday of Martin Charles Golumbic, 2009, Jerusalem, Tiberias, Haifa, Israel. pp.1-21
Communication dans un congrès
hal-00415578v1
|
|||
Minimisation d'une fonction sous-modulaire graphique ou le problème de la coopération optimale3ème Journée Combinatoire Rhône-Alpes, Jul 2005, Lyon, France
Communication dans un congrès
hal-00379074v1
|
|||
Some joint occurrences of integer rounding and total dual integrality6th Haifa Workshop on Interdisciplinary Applications of Graph Theory, Combinatory and Algorithms, May 2006, --, Israel
Communication dans un congrès
hal-00379094v1
|
|||
An excluded minor characterization of Seymour graphs,proceedings 15th IPCO, 2011, LNCS 6655, pp.1-13
Article dans une revue
hal-00677808v1
|