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
Crossing Roads in Combinatorial Optimization: The SalesmanThe Japanese Conference on Combinatorics and its Applications, May 2016, Kyoto, Japan
Communication dans un congrès
hal-01420351v1
|
|||
Improving the Approximation Guarantee for TSP PathsWorkshop on Combinatorial Optimization, 2013, Aussois, France
Communication dans un congrès
hal-01026460v1
|
|||
|
How many matchings cover the nodes of a graph?2019
Pré-publication, Document de travail
hal-02148038v1
|
||
Introduction à la Méthode des Coupes de Lovasz-Schrijver : Applications de la Programmation Semi Définie3ème Journée Combinatoire Rhône-Alpes, Jul 2005, Lyon, France
Communication dans un congrès
hal-00379080v1
|
|||
Ways to Matching Generalizations50th anniversary of the Hungatrian method, Oct 2005, budapest, Hungary
Communication dans un congrès
hal-00396251v1
|
|||
Some recent results on the duality gapLovasz's Kyoto price Satellite workshop, Nov 2010, Tokyo, Japan
Communication dans un congrès
hal-00688023v1
|
|||
Multiflow feasibility: an annotated tableauResearch Trends in Combinatorial Optimization, 2009, pp.261--283
Article dans une revue
hal-01198835v1
|
|||
|
Cyclic Orders: Equivalence and Duality2006
Pré-publication, Document de travail
hal-00005192v1
|
||
Integer Plane Multiflow MaximisationOne-Quarter-Approximation and Gaps.2020
Pré-publication, Document de travail
hal-03047827v1
|
|||
On Metric Generators of GraphsMathematics of Operations Research, 2004, 29, pp.383-393
Article dans une revue
hal-00427651v1
|
|||
A new co-NP characterization of SeymourAussois workshop on Combinatorial Optimization, Jan 2011, Aussois, France
Communication dans un congrès
hal-00688019v1
|
|||
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
|
|||
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
|
|||
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
|
|||
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
|
|||
Compact Extensions for MultiflowsFirst Cargese Workshop in Combinatorial Optimization, Sep 2011, Cargèse, France
Communication dans un congrès
hal-00688196v1
|
|||
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
|
|||
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
|
|||
From Pyramids to virtual private Network PolyhedraColloque Optimisation Combinatoire, Oct 2011, Oberwolfach, Germany
Communication dans un congrès
hal-00688373v1
|
|||
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 Collapse of the Virtual Private Network PyramidColloque Optimisation Combinatoire, 2011, Oberwolfach, Germany
Communication dans un congrès
hal-01026408v1
|
|||
Eight-Fifth approximation for TSP paths, Integer Programming and Combinatorial Optimization (IPCO) 16LNCS 7801, 2013, pp.362 - 374
Article dans une revue
hal-00972007v1
|
|||
T-joins and their application for the TSPWorkshop in Combinatorial Optimizationon, 2012, Cargese, France
Communication dans un congrès
hal-01026394v1
|
|||
Travelling Salesmen on Bounded Degree TrailsRouting and Network Design Workshop, Sep 2015, Bonn, Germany
Communication dans un congrès
hal-01420333v1
|
|||
Cyclic Orders : equivalence and dualityCombinatorica, 2008, 28 (2), pp.131-143
Article dans une revue
hal-00363653v1
|
|||
An excluded minor characterization of Seymour graphs,proceedings 15th IPCO, 2011, LNCS 6655, pp.1-13
Article dans une revue
hal-00677808v1
|
|||
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
|