Zobrazeno 1 - 10
of 122
pro vyhledávání: '"Michelon, Philippe"'
Publikováno v:
In Electric Power Systems Research October 2024 235
Autor:
da Silva, Thiago Gouveia, Filho, Gilberto F. de Sousa, Ochi, Luiz Satoru, Michelon, Philippe, Gueye, Serigne, Cabral, Lucidio A. F.
Let G = (V, E, L) be an edge-labeled graph such that V is the set of vertices, E is the set of edges, L is the set of labels (colors) and each edge e \in E has a label l(e) associated; The goal of the minimum labeling global cut problem (MLGCP) is to
Externí odkaz:
http://arxiv.org/abs/1903.04319
In this paper, we want to study the informative value of negative links in signed complex networks. For this purpose, we extract and analyze a collection of signed networks representing voting sessions of the European Parliament (EP). We first proces
Externí odkaz:
http://arxiv.org/abs/1507.04215
Autor:
González, Pedro Henrique, Simonetti, Luidi, Michelon, Philippe, Martinhon, Carlos, Santos, Edcarllos
This paper presents an iterated local search for the fixed-charge uncapacitated network design problem with user-optimal flow (FCNDP-UOF), which concerns routing multiple commodities from its origin to its destination by signing a network through sel
Externí odkaz:
http://arxiv.org/abs/1504.03217
Autor:
Corrêa, Ricardo C., Michelon, Philippe, Cun, Bertrand Le, Mautor, Thierry, Donne, Diego Delle
Finding the clique of maximum cardinality in an arbitrary graph is an NP-Hard problem that has many applications, which has motivated studies to solve it exactly despite its difficulty. The great majority of algorithms proposed in the literature are
Externí odkaz:
http://arxiv.org/abs/1407.1209
Autor:
Silva, Thiago Gouveia da, Queiroga, Eduardo, Ochi, Luiz Satoru, Cabral, Lucídio dos Anjos Formiga, Gueye, Serigne, Michelon, Philippe
Publikováno v:
In European Journal of Operational Research 1 April 2019 274(1):22-34
Autor:
Silva, ThiagoGouveiada a, Gueye, Serigne, Michelon, Philippe, Ochi, LuizSatoru, Cabral, LucídiodosAnjosFormiga
Publikováno v:
In EURO Journal on Computational Optimization March 2019 7(1):47-77
The efficient use of bandwidth for radio communications becomes more and more crucial when developing new information technologies and their applications. The core issues are addressed by the so-called Frequency Assignment Problems (FAP). Our work in
Externí odkaz:
http://arxiv.org/abs/1001.1093
Publikováno v:
VI ALIO/EURO Workshop on Applied Combinatorial Optimization, Buenos Aires : Argentine (2008)
We propose an exact method which combines the resolution search and branch & bound algorithms for solving the 0?1 Multidimensional Knapsack Problem. This algorithm is able to prove large?scale strong correlated instances. The optimal values of the 10
Externí odkaz:
http://arxiv.org/abs/0905.0848
Autor:
Rosa, Bruno Ferreira, Souza, Marcone Jamilson Freitas, de Souza, Sérgio Ricardo, de França Filho, Moacir Felizardo, Ales, Zacharie, Michelon, Philippe Yves Paul
Publikováno v:
In Computers and Operations Research May 2017 81:203-215