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
|
|
Impact of RSA Optimization Objectives on Optical Network State2021
Pré-publication, Document de travail
hal-03155966v1
|
||
Computing clique and chromatic number of circular-perfect graphs in polynomial timeMathematical Programming, Series A, 2013, 141, pp.121-133
Article dans une revue
hal-00760621v1
|
|||
On the imperfection ratio of a-perfect webs8th Combinatorial Optimization Workshop, Aussois, 2005, France. pp.électronique
Communication dans un congrès
hal-00308153v1
|
|||
On stable set polytopes of circular-perfect graphs5th ALIO/EURO conference on combinatorial optimization, Oct 2005, France
Communication dans un congrès
hal-00308148v1
|
|||
|
|
The Normal Graph Conjecture for Two Classes of Sparse GraphsGraphs and Combinatorics, 2018, 34 (1), pp.139-157
Article dans une revue
hal-02045757v1
|
||
|
|
A linear-time algorithm for the identifying code problem on block graphsElectronic Notes in Discrete Mathematics, 2017, 62, pp.249-254
Article dans une revue
hal-02045776v1
|
||
|
|
On the Online Min-Wait Relocation ProblemElectronic Notes in Discrete Mathematics, 2015, 50, pp.281-286
Article dans une revue
hal-02045800v1
|
||
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
|
||
|
|
On three domination numbers in block graphs2018
Pré-publication, Document de travail
hal-01933492v1
|
||
Almost all webs are not rank-perfect7th Combinatorial Optimization Workshop, Mar 2003, France. pp.électronique
Communication dans un congrès
hal-00307777v1
|
|||
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
|
|||
|
|
Fleet management for autonomous vehicles using multicommodity coupled flows in time-expanded networks17th International Symposium on Experimental Algorithms (SEA 2018), Leibniz International Proceedings in Informatics (LIPIcs), 2018
Chapitre d'ouvrage
hal-02045789v1
|
||
|
|
Polyhedra associated with identifying codes in graphsDiscrete Applied Mathematics, 2018, 245, pp.16-27. ⟨10.1016/j.dam.2017.06.005⟩
Article dans une revue
hal-02047315v1
|
||
|
|
On the Chvátal-rank of facets for the set covering polyhedron of circular matricesElectronic Notes in Discrete Mathematics, 2018, 69, pp.85-92. ⟨10.1016/j.endm.2018.07.012⟩
Article dans une revue
hal-03137958v1
|
||
A construction for non-rank facets of stable set polytopes of websEuropean Journal of Combinatorics, 2006, 27 (7), pp.1172--1185
Article dans une revue
hal-00333677v1
|
|||
|
|
Computing the clique number of a-perfect graphs in polynomial timeEuropean Journal of Combinatorics, 2014, 35, pp.449-458. ⟨10.1016/j.ejc.2013.06.025⟩
Article dans une revue
hal-00920846v1
|
||
How imperfect are webs and antiwebsXXXIII Annual Conference of the Operational Research Society of Italy, Sep 2002, Italy. pp.électronique
Communication dans un congrès
hal-00307774v1
|
|||
|
|
Fleet management for autonomous vehicles using flows in time-expanded networksTOP, 2019, 27 (2), pp.288-311. ⟨10.1007/s11750-019-00506-4⟩
Article dans une revue
hal-02083489v1
|
||
|
|
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
|
||
|
|
A polyhedral approach to locating-dominating sets in graphsElectronic Notes in Discrete Mathematics, 2015, 50, pp.89-94
Article dans une revue
hal-02045771v1
|