A polyhedral approach to the generalized minimum labeling spanning tree problem

Autor: ThiagoGouveiada Silva, Serigne Gueye, Philippe Michelon, LuizSatoru Ochi, LucídiodosAnjosFormiga Cabral

Publikováno v: EURO Journal on Computational Optimization, Vol 7, Iss 1, Pp 47-77 (2019)

The minimum labeling spanning tree problem (MLSTP) is a combinatorial optimization problem that consists in finding a spanning tree in a simple graph G, in which each edge has one label, by using a minimum number of labels. It is an NP-hard problem t

Externí odkaz: https://doaj.org/article/05898c0ad5c440f29cd7df04ac0054f2

Integer and constraint programming approaches for providing optimality to the bandwidth multicoloring problem

Autor: Bruno Dias, Nelson Maculan, Rosiane de Freitas, Philippe Michelon

Publikováno v: RAIRO - Operations Research. 55:S1949-S1967

In this paper, constraint and integer programming techniques are applied to solving bandwidth coloring problems, in the sense of proving optimality or finding better feasible solutions for benchmark instances from the literature. The Bandwidth Colori

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::942313229564746e0888fda4c907554d
https://doi.org/10.1051/ro/2020065

A hybrid metaheuristic for the minimum labeling spanning tree problem

Autor: Eduardo Queiroga, Luiz Satoru Ochi, Thiago Gouveia da Silva, Philippe Michelon, Serigne Gueye, Lucídio dos Anjos Formiga Cabral

Publikováno v: European Journal of Operational Research
European Journal of Operational Research, Elsevier, 2019, 274 (1), pp.22-34. ⟨10.1016/j.ejor.2018.09.044⟩

An edge-labeled graph (ELG) is a graph in which each edge has a label associated. Given G, an ELG, the minimum labeling spanning tree problem (MLSTP) is an NP-hard problem that consists in finding a spanning tree in G by using a minimum number of lab

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::058d3fb4f4ad96dafde9eead04db8d98
https://doi.org/10.1016/j.ejor.2018.09.044

OPTIDENS: An optimization model to explore the conditions of possibility of slow but accessible urban areas

Autor: Cyrille Genre-Grandpierre, Philippe Michelon, Serigne Gueye, Alena Melnikava

Publikováno v: Environment and Planning B: Urban Analytics and City Science
Environment and Planning B: Urban Analytics and City Science, SAGE Publications, 2020, pp.239980832091303. ⟨10.1177/2399808320913034⟩
Environment and Planning B: Urban Analytics and City Science, 2020, 48, pp.239980832091303. ⟨10.1177/2399808320913034⟩

International audience; High levels of accessibility for people and jobs are the very essence of urban areas, as they allow agglomeration economies and also provide social benefits. In the past, slow modes of transportation meant population and activ

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::99e3db62038e235c73ef41d9c5b5b74e
https://hal.archives-ouvertes.fr/hal-02543806

Locality Sensitive Algotrithms for Data Mule Routing Problem

Autor: Lúcia Maria de A. Drummond, Luiz Satoru Ochi, Philippe Michelon, Pedro Henrique González, Felipe P. do Carmo, Uéverton S. Souza, Pablo Luiz Araújo Munhoz

Publikováno v: Algorithmic Aspects in Information and Management ISBN: 9783030271947
AAIM

A usual way to collect data in a Wireless Sensor Network (WSN) is by the support of a special agent, called data mule, that moves between sensor nodes and performs all communication between them. In this work, the focus is on the construction of the

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::0996b64bd6bc5041d82a6adfb613e9f4
https://doi.org/10.1007/978-3-030-27195-4_22