Filtrer vos résultats
- 42
- 24
- 28
- 23
- 8
- 4
- 3
- 1
- 59
- 8
- 7
- 3
- 1
- 1
- 5
- 4
- 7
- 3
- 3
- 3
- 9
- 4
- 2
- 1
- 2
- 3
- 1
- 2
- 3
- 6
- 1
- 4
- 1
- 62
- 4
- 32
- 29
- 27
- 27
- 22
- 8
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 66
- 12
- 10
- 9
- 8
- 7
- 7
- 5
- 4
- 4
- 4
- 3
- 3
- 3
- 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
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
66 résultats
|
|
Automatic network reconstruction from experimental time-series data: A surveyInformation Technology, 2014, 56 (2), ⟨10.1515/itit-2013-1020⟩
Article dans une revue
hal-02047311v1
|
||
|
|
Progress on the description of identifying code polyhedra for some families of split graphsDiscrete Optimization, 2016, 22, pp.225-240. ⟨10.1016/j.disopt.2016.06.002⟩
Article dans une revue
hal-02047313v1
|
||
|
|
Fleet management for autonomous vehicles: Online PDP under special constraintsRAIRO - Operations Research, 2019, 53, pp.1007-1031. ⟨10.1051/ro/2018042⟩
Article dans une revue
hal-02047318v1
|
||
On Non-Rank Facets in Stable Set Polytopes of Webs with Clique Number FourCTW, 2003, Netherlands. pp.96--99
Communication dans un congrès
hal-00307769v1
|
|||
|
|
How unique is Lovász's theta function?VIII ALIO/EURO Workshop on Applied Combinatorial Optimization, Dec 2014, Montevideo, Uruguay
Communication dans un congrès
hal-01095638v1
|
||
|
|
Assessing the Health of Flexgrid Optical Networks[Research Report] LIMOS (UMR CNRS 6158), université Clermont Auvergne, France; Institut Mines Telecom, IMT Atlantique, Brest. 2020
Rapport
hal-03123302v1
|
||
Computing the clique number of a-perfect graphs in polynomial timeProceedings of Eurocomb'11, Aug 2011, Budapest, Hungary. pp.705-710
Communication dans un congrès
hal-00592080v1
|
|||
Characterizing and bounding the imperfection ratio for some classes of graphsMathematical Programming, Series A, 2009, 118 (1), pp.37-46. ⟨10.1007/s10107-007-0182-9⟩
Article dans une revue
istex
hal-00308150v1
|
|||
Relocation in Carsharing Systems using Flows in Time-Expanded NetworksROADEF - 15ème congrès annuel de la Société française de recherche opérationnelle et d'aide à la décision, Société française de recherche opérationnelle et d'aide à la décision, Feb 2014, Bordeaux, France
Communication dans un congrès
hal-00946413v1
|
|||
A construction for non-rank facets of stable set polytopes of websEurocomb03. European conference on Combinatorics, Graph Theory and Application, Sep 2003, Czech Republic. pp.301--305
Communication dans un congrès
hal-00307767v1
|
|||
La plupart des webs ne sont pas rang-parfaits.Journées Polyèdres et Optimisation Combinatoire JPOC, 2003, France. pp.32--35
Communication dans un congrès
hal-00307771v1
|
|||
On the polynomial time computability of the circular chromatic number for some superclasses of perfect graphLagos'09, 2009, Brazil. pp.53-58
Communication dans un congrès
hal-00790656v1
|
|||
|
|
On Non-Rank Facets in Stable Set Polytopes of Webs with Clique Number FourDiscrete Applied Mathematics, 2006, 154, pp.1408--1415
Article dans une revue
hal-00307757v1
|
||
On the imperfection ratio of a-perfect graphs and some consequencesCTW05 - Cologne-Twente Workshop on Graphs and Combinatorial Optimization, May 2005, Germany. pp.électronique
Communication dans un congrès
hal-00308147v1
|
|||
|
|
A note on the Chvátal rank of clique family inequalitiesRAIRO - Operations Research, 2007, 41, pp.289--294
Article dans une revue
hal-00307758v1
|
||
|
|
A novel integer linear programming model for routing and spectrum assignment in optical networks2019 Federated Conference on Computer Science and Information Systems, Sep 2019, Leipzig, Germany. pp.127-134, ⟨10.15439/2019F188⟩
Communication dans un congrès
hal-03135240v1
|
||
|
|
Fleet management for autonomous vehicles using flows in time-expanded networksElectronic Notes in Discrete Mathematics, 2017, 62, pp.255-260
Article dans une revue
hal-02045780v1
|
||
|
|
Analyzing the dynamics of discrete deterministic systems2016 International Conference on Control, Decision and Information Technologies (CoDIT), Apr 2016, Saint Julian's, Malta. pp.382-387
Communication dans un congrès
hal-02045802v1
|
||
Graphes fortement circulaires-parfaits sans trianglesJPOC2 - Deuxièmes Journées Polyèdres et Optimisation Combinatoire, Jun 2005, France. pp.électronique
Communication dans un congrès
hal-00308152v1
|
|||
Almost all webs are not rank-perfect7th Combinatorial Optimization Workshop, Mar 2003, France. pp.électronique
Communication dans un congrès
hal-00307777v1
|
|||
|
|
On three domination numbers in block graphs2018
Pré-publication, Document de travail
hal-01933492v1
|
||
|
|
On some graph classes related to perfect graphs: A surveyDiscrete Applied Mathematics, 2020, 281, pp.42-60. ⟨10.1016/j.dam.2019.05.019⟩
Article dans une revue
hal-03142102v1
|
||
|
|
Reconstructing X'-deterministic extended Petri nets from experimental time-series data X2013
Rapport
hal-00829880v2
|
||
|
|
Relocation in Carsharing Systems using Flows in Time-Expanded NetworksExperimental Algorithms. SEA 2014, 2014, 978-3-319-07958-5. ⟨10.1007/978-3-319-07959-2_8⟩
Chapitre d'ouvrage
hal-00908242v1
|
||
|
|
A polyhedral approach to locating-dominating sets in graphsElectronic Notes in Discrete Mathematics, 2015, 50, pp.89-94
Article dans une revue
hal-02045771v1
|
||
On strongly circular-perfectnessVIIth International Conference on Graph Theory, Oct 2005, France. pp.369--374
Communication dans un congrès
hal-00308149v1
|
|||
|
|
Almost all webs are not rank-perfectMathematical Programming, 2006, 105, pp.311--328
Article dans une revue
hal-00307763v1
|
||
|
|
Triangle-Free Strongly Circular-Perfect GraphsDiscrete Mathematics, 2009, 309, pp.3632-3643
Article dans une revue
hal-00308145v1
|
||
|
|
The identifying code, the locating-dominating, the open locating-dominating and the locating total-dominating problems under some graph operationsLAGOS 2019, Jun 2019, Belo Horizonte, Brazil. pp.135-145, ⟨10.1016/j.entcs.2019.08.013⟩
Communication dans un congrès
hal-02017469v1
|
||
|
|
Polyhedra associated with identifying codes in graphsDiscrete Applied Mathematics, 2018, 245, pp.16-27
Article dans une revue
hal-02017458v1
|