Optimization of wireless sensor networks deployment with coverage and connectivity constraints

Autor: Olivier Hudry, Sourour Elloumi, Agnès Plateau, Stephane Rovedakis, Estel Marie

Publikováno v: 2017 4th International Conference on Control, Decision and Information Technologies (CoDIT)
2017 4th International Conference on Control, Decision and Information Technologies (CoDIT), Apr 2017, Barcelona, France. IEEE, 〈10.1109/CoDIT.2017.8102614〉
2017 4th International Conference on Control, Decision and Information Technologies (CoDIT), Apr 2017, Barcelona, France. ⟨10.1109/CoDIT.2017.8102614⟩
CoDIT

Wireless sensor networks have been widely deployed in the last decades to provide various services, like environmental monitoring or object tracking. Such a network is composed of a set of sensor nodes which are used to sense and transmit collected i

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::85d970b83fefe91afe639a7a474d8009
https://hal.archives-ouvertes.fr/hal-01811334

Hybrid column generation for large-size Covering Integer Programs : application to transportation planning

Autor: Laurent Alfandari, Agnès Plateau, Jalila Sadki, Anass Nagih

Publikováno v: Computers and Operations Research
Computers and Operations Research, Elsevier, 2013, 40 (8), pp.1938-1946. ⟨10.1016/j.cor.2013.02.020⟩

International audience; The well-known column generation scheme is often an efficient approach for solving the linear relaxation of large-size Covering Integer Programs (CIP). In this paper, this technique is hybridized with an extension of the best-

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5c4373d6c44817e00236aebb166d53a3
https://hal.archives-ouvertes.fr/hal-01267680

Generalizations of Dobson approximation algorithm and cooperation with Column Generation for large-size Covering Integer Programs

Autor: Laurent Alfandari, Anass Nagih, Agnès Plateau, Jalila Sadki

Publikováno v: ISCO 2012, 2nd International Symposium on Combinatorial Optimization
ISCO 2012, 2nd International Symposium on Combinatorial Optimization, Apr 2012, Athens, Greece. pp.1-4
HAL

This paper deals with generalizations of Dobson approximation algorithm and proposes its cooperation with Column Generation for large-size Covering Interger Programs

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::4ec9e4a843d7ee37f6d3db32a8823d71
https://hal.archives-ouvertes.fr/hal-01126061

Hybridization of column generation and approximation heuristics for large-size Covering Integer Programs

Autor: Laurent Alfandari, Anass Nagih, Agnès Plateau, Jalila Sadki

Publikováno v: MIC 2011 : The IX Metaheuristics International Conference
MIC 2011 : The IX Metaheuristics International Conference, Jul 2011, Udine, Italy. pp.531-533
HAL

The NP-hard Covering Integer Programming minimization problem models manyreal-case applications. Covering Integer Programs can appear as basic models in someapplications like location problems, but also as master problemsresulting from a Dantzig-wolf

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::2c1ea2f8c40c597ed541c89c19fbb4c0
https://hal.science/hal-01126023

A computational study for the p-median Problem

Autor: Agnès Plateau, Sourour Elloumi

Publikováno v: ISCO 2010-International Symposium on Combinatorial Optimization
ISCO10. International Symposium on Combinatorial Optimization
ISCO10. International Symposium on Combinatorial Optimization, Mar 2010, Hammamet, Tunisia. pp.455-462, ⟨10.1016/j.endm.2010.05.058⟩

Given a set of clients and a set of potential sites for facilities, the p -median problem consists of opening a set of p sites and assigning each client to the closest open facility to it. In [Elloumi, S., A tighter formulation of the p-median proble

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::808a8b8bf6c8bebd68e09a5cf011ce2d
https://hal.archives-ouvertes.fr/hal-01125798