Filtrer vos résultats
- 60
- 25
- 43
- 37
- 2
- 2
- 1
- 78
- 35
- 1
- 5
- 2
- 2
- 5
- 10
- 3
- 7
- 5
- 2
- 10
- 7
- 6
- 9
- 5
- 6
- 81
- 4
- 85
- 12
- 10
- 9
- 9
- 7
- 4
- 4
- 4
- 4
- 3
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 85
- 18
- 11
- 11
- 10
- 10
- 8
- 7
- 7
- 5
- 5
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 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
85 résultats
Fiber cable network design in tree networksEuropean Journal of Operational Research, 2018, 269 (3), pp.1086 - 1106. ⟨10.1016/j.ejor.2018.02.034⟩
Article dans une revue
hal-01791553v1
|
|||
|
|
Optimal routing configuration clustering through dynamic programmingALGOTEL 2019 : 21èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2019, Saint Laurent de la Cabrerisse, France
Communication dans un congrès
hal-02125608v1
|
||
Characterization of Ping-Pong Optimized Pulse Shaping-OFDM (POPS-OFDM) for 5G systemsVTC Spring 2015 : 81st Vehicular Technology Conference, May 2015, Glascow, United Kingdom. pp.1 - 6, ⟨10.1109/VTCSpring.2015.7145741⟩
Communication dans un congrès
hal-01265526v1
|
|||
Algorithms and formulations for the minimum cut separator problemElectronic Notes in Discrete Mathematics, 2010, 36 (1), pp.977-983. ⟨10.1016/j.endm.2010.05.124⟩
Article dans une revue
istex
hal-00528560v1
|
|||
|
|
Byzantine-resistant reputation-based trust managementCOLLABORATECOM 2013 : 9th IEEE International Conference on Collaborative Computing : Networking, Applications and Worksharing, Oct 2013, Austin, United States. pp.269 - 278, ⟨10.4108/icst.collaboratecom.2013.254048⟩
Communication dans un congrès
hal-01261638v1
|
||
A framework for joint admission control, resource allocation and pricing for network slicing in 5GGLOBECOM 2021: IEEE Global Communications Conference, Dec 2021, Madrid, Spain. pp.1-6, ⟨10.1109/GLOBECOM46510.2021.9685847⟩
Communication dans un congrès
hal-03546908v1
|
|||
|
|
New bounds for subset selection from conic relaxationsEuropean Journal of Operational Research, 2022, 298 (2), pp.425-438. ⟨10.1016/j.ejor.2021.07.011⟩
Article dans une revue
hal-03557321v1
|
||
|
|
Fractional routing using pairs of failure-disjoint pathsDiscrete Applied Mathematics, 2014, 164 (1), pp.47 - 60. ⟨10.1016/j.dam.2011.12.019⟩
Article dans une revue
hal-01263061v1
|
||
The k-separator problem : polyhedra, complexity and approximation resultsJournal of Combinatorial Optimization, 2015, 29 (1), pp.276 - 307. ⟨10.1007/s10878-014-9753-x⟩
Article dans une revue
hal-01262822v1
|
|||
Convex and concave envelopes: revisited and new perspectivesOperations Research Letters, 2017, 45 (5), pp.421 - 426. ⟨10.1016/j.orl.2017.06.008⟩
Article dans une revue
hal-01662836v1
|
|||
|
|
Approximability of robust network design: the directed caseThe 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022), Mar 2022, Marseille, France. pp.6:1-6:16, ⟨10.4230/LIPIcs.STACS.2022.6⟩
Communication dans un congrès
hal-03953268v1
|
||
An efficient tree-based model for multicommodity flow problemsISCO '12 : 2nd international symposium on combinatorial optimization, Apr 2012, Athens, Greece
Communication dans un congrès
hal-00833882v1
|
|||
|
|
On the most imbalanced orientation of a graphJournal of Combinatorial Optimization, 2018, 36 (2), pp.637-669. ⟨10.1007/s10878-017-0117-1⟩
Article dans une revue
hal-01497902v1
|
||
|
|
A two phase investment game for competitive opinion dynamics in social networksInformation Processing and Management, 2020, 57 (2), pp.102064:1-20. ⟨10.1016/j.ipm.2019.102064⟩
Article dans une revue
hal-01924838v3
|
||
Spectral bounds for unconstrained (−1,1)-quadratic optimization problemsEuropean Journal of Operational Research, 2010, 207 (1), pp.15-24. ⟨10.1016/j.ejor.2010.02.042⟩
Article dans une revue
istex
hal-00565883v1
|
|||
The k-separator problemCOCOON '13 : 19th International Computing & Combinatorics Conference, Jun 2013, Hangzhou, China. pp.337-348, ⟨10.1007/978-3-642-38768-5_31⟩
Communication dans un congrès
istex
hal-00843860v1
|
|||
Résultats préliminaires sur les graphes à composantes connexes unicycliquesRoadef 2008 : 9ème congrés de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, Feb 2008, Clermont-Ferrand, France
Communication dans un congrès
hal-01380276v1
|
|||
Robust routing and optimal partitioning of a traffic demand polytopeInternational Transactions in Operational Research, 2011, 18 (3), pp.307-333. ⟨10.1111/j.1475-3995.2010.00764.x⟩
Article dans une revue
istex
hal-00678809v1
|
|||
|
|
Beamforming-based broadcast scheme for multihop wireless networks with transmission range adjustmentWONS 2013 : The 10th Annual Conference on Wireless On-Demand Network Systems and Services, Mar 2013, Banff, Canada. pp.107 - 109, ⟨10.1109/WONS.2013.6578330⟩
Communication dans un congrès
hal-00865275v1
|
||
|
|
From graph orientation to the unweighted maximum cutCOCOON 2016 : 22nd International Conference on Computing and Combinatorics, Aug 2016, Ho Chi Minh Ville, Vietnam. pp.370-384, ⟨10.1007/978-3-319-42634-1_30⟩
Communication dans un congrès
hal-01497887v1
|
||
|
|
A full description of polytopes related to the index of the lowest nonzero row of an assignment matrixISCO 2016 : 4th International Symposium on Combinatorial Optimization, May 2016, Vietri Sul Mare, Italy. pp.13-25, ⟨10.1007/978-3-319-45587-7_2⟩
Communication dans un congrès
hal-01497880v1
|
||
A Zero-sum Game for Opinion Dynamics in a Social Network with Competing Camps13th European Meeting on Game Theory (SING13), Jul 2017, Paris, France
Poster de conférence
hal-01716712v1
|
|||
|
|
A Framework for Optimal Investment Strategies for Competing Camps in a Social NetworkPGMO Days 2017 – Gaspard Monge Program For Optimization, Operations Research and their Interactions with Data Sciences, Nov 2017, Paris, France. pp.1, 2017
Poster de conférence
hal-01712293v1
|
||
On the minimum cut separator problemNetworks, 2012, 59 (1), pp.30-36. ⟨10.1002/net.20478⟩
Article dans une revue
istex
hal-00679174v1
|
|||
On unicyclic graphs with a lower bounded girthECCO XXI : European Chapter on Combinatorial Optimization, May 2008, Dubrovnik, Croatia
Communication dans un congrès
hal-01378749v1
|
|||
Designing Steiner networks with unicyclic connected components : an easy problemSIAM Journal on Discrete Mathematics, 2010, 24 (4), pp.1541 - 1557. ⟨10.1137/090759033⟩
Article dans une revue
hal-01308332v1
|
|||
Robust routing in communication networksProgress in combinatorial optimization, Iste; Wiley, pp.353 - 390, 2011, 978-1-848-21206-0
Chapitre d'ouvrage
hal-01279133v1
|
|||
Optimal mapping of cloud virtual machinesElectronic Notes in Discrete Mathematics, 2016, 52, pp.93 - 100. ⟨10.1016/j.endm.2016.03.013⟩
Article dans une revue
hal-01453255v1
|
|||
|
|
Enhancing Broadcast Vehicular Communications Using Beamforming TechniqueInternational Workshop on Vehicular Communications and Networking (VECON), 2012, pp.565
Article dans une revue
hal-00761075v1
|
||
Cables network design optimization for the Fiber To The HomeDRCN 2016 : 12th International Conference on the Design of Reliable Communication Networks , Mar 2016, Paris, France. pp.87 - 94, ⟨10.1109/DRCN.2016.7470839⟩
Communication dans un congrès
hal-01450509v1
|