Filtrer vos résultats
- 60
- 18
- 31
- 25
- 11
- 4
- 3
- 3
- 1
- 70
- 42
- 6
- 1
- 1
- 5
- 9
- 3
- 4
- 7
- 4
- 5
- 4
- 6
- 1
- 7
- 8
- 2
- 6
- 2
- 1
- 2
- 1
- 1
- 69
- 9
- 62
- 11
- 5
- 5
- 5
- 2
- 2
- 1
- 1
- 1
- 1
- 78
- 27
- 10
- 7
- 5
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
78 résultats
Challenges, Solutions and Implications for Large Scale Enterprise Systems: OR in the Age of Big Data6th International Conference on Operations Research and Enterprise Systems (ICORES 2017), Feb 2017, Porto, Portugal
Communication dans un congrès
hal-02287562v1
|
|||
|
|
Classes empiétantes dans un graphe et application aux interactions entre protéines2005
Autre publication scientifique
hal-00199799v1
|
||
Some Complexity Considerations on the Uniqueness of Graph ColouringWSEAS Transactions on Mathematics, 2023, 22, pp.art. #54, 483-493
Article dans une revue
hal-02287571v1
|
|||
Dominating, Locating-Dominating and Identifying Codes in the q-ary Lee Hypercube11th International Colloquium on Graph Theory and Combinatorics (ICGT 2022), 2022, Montpellier, France
Communication dans un congrès
hal-03744673v1
|
|||
Descent with Mutations Applied to the Linear Ordering ProblemCombinatorial optimization - Springer LNCS 10856, pp.253-264, 2018
Chapitre d'ouvrage
hal-02264946v1
|
|||
On the Complexity of the Uniqueness of Solutions in Graph Problems2017
Autre publication scientifique
hal-01613394v1
|
|||
Journées de 2007 de la Société francophone de classification. Avant-proposMathematics and Social Sciences, 2009, 187, pp.5-6
Article dans une revue
hal-02286699v1
|
|||
Contributions to Mathematical PsychologyElectronic Notes in Discrete Mathematics, 2013, 42, pp.1-7
Article dans une revue
hal-02286700v1
|
|||
A branch and bound method for the aggregation of symmetric relations2nd International Symposium on Combinatorial Optimization (ISCO 2012), Apr 2012, Athènes, Greece. pp.127-130
Communication dans un congrès
hal-02286302v1
|
|||
On the number of optimal identifying codes in a twin-free graphDiscrete Applied Mathematics, 2015, 180, pp.111-119
Article dans une revue
hal-02286996v1
|
|||
Complexity of computing median linear orders and variantsElectronic Notes in Discrete Mathematics, 2013, 42, pp.57-64
Article dans une revue
hal-02286384v1
|
|||
Maximizing the Number of Scheduled Lightpath Demands in Optical Networks by Conflict GraphsInternational Journal of Mathematics, Statistics and Operations Research, 2021
Article dans une revue
hal-03354939v1
|
|||
Resolution of a Routing and Wavelength Assignment Problem by Independent Sets in Conflict Graphs7th International Conference on Control, Decision and Information Technologies (CoDIT’20), 2020, Prague, Czech Republic
Communication dans un congrès
hal-03189496v1
|
|||
|
|
Optimization of wireless sensor networks deployment with coverage and connectivity constraintsAnnals of Operations Research, 2021, 298 (1-2), pp.183-206. ⟨10.1007/s10479-018-2943-7⟩
Article dans une revue
hal-03189488v1
|
||
Optimization of wireless sensor networks deployment with coverage and connectivity constraints2017 4th International Conference on Control, Decision and Information Technologies (CoDIT), Apr 2017, Barcelona, Spain. pp.0336-0341, ⟨10.1109/CoDIT.2017.8102614⟩
Communication dans un congrès
hal-01811334v1
|
|||
Application of the “descent with mutations” metaheuristic to a clique partitioning problemRAIRO - Operations Research, 2019, 53 (3), pp.1083-1095
Article dans une revue
hal-02264943v1
|
|||
|
|
Minimum Sizes of Identifying Codes in Graphs Differing by One Edge or One Vertex2012
Pré-publication, Document de travail
hal-00731811v1
|
||
Psychologie mathématiqueMathematics and Social Sciences, 2012, 199, pp.5-6
Article dans une revue
hal-02286701v1
|
|||
Complexité et théorie du voteBulletin de la Société française de recherche opérationnelle et d’aide à la décision (ROADEF), 2015, 33, pp.7-14
Article dans une revue
hal-02287100v1
|
|||
|
|
Taille minimum des codes identifiants dans les graphes différant par un sommet ou une arête2011
Rapport
hal-00623981v1
|
||
Médianes métriques et latticiellesBOUYSSOU Denis, DUBOIS Didier, PIRLOT Marc, PRADE Henri. Concepts et Méthodes pour l'aide à la décision 3, HERMES, LAVOISIER, pp.274-317, 2006, Informatique et Systèmes d'information
Chapitre d'ouvrage
hal-00292647v1
|
|||
|
|
Complexity of Unique (Optimal) Solutions in Graphs: Vertex Cover and DominationJournal of Combinatorial Mathematics and Combinatorial Computing, 2019, 110, pp.217-240
Article dans une revue
hal-01613388v1
|
||
Structural properties of identifying codes: some results, conjectures and open problemsWorkshop on Identifying Codes, Nov 2011, Bordeaux, France
Communication dans un congrès
hal-02286696v1
|
|||
Weighted Tournament SolutionsHandbook of Computational Social Choice, Cambridge University Press, pp.85-102, 2016
Chapitre d'ouvrage
hal-02286702v1
|
|||
On the Ensemble of Optimal Dominating and Locating-Dominating Codes in a GraphInformation Processing Letters, 2015, 115, pp.699-702
Article dans une revue
hal-02287016v1
|
|||
Operations research and voting theoryOperations Research and Enterprise Systems, G.H. Parlier, F. Liberatore, M. Demange (eds), Springer, Communications in Computer and Information Science Series Vol. 884, pp.20-41, 2018
Chapitre d'ouvrage
hal-02264947v1
|
|||
Introduction à l’optimisation continue et discrèteLavoisier, pp.500, 2019
Ouvrages
hal-02288068v1
|
|||
|
|
Computation of median orders: complexity resultspp.36, 2004
Ouvrages
hal-00018369v1
|
||
Complexity results on dominating codesThe Second Malta Conference in Graph Theory and Combinatorics, Jun 2017, Qawra, Malta
Communication dans un congrès
hal-02287572v1
|
|||
|
|
On the Complexity of Determining Whether there is a Unique Hamiltonian Cycle or PathWSEAS Transactions on Mathematics, 2022, 21, pp.433-446
Article dans une revue
hal-01680709v1
|