Phillippe Samer
Phillippe Samer
PhD candidate, Universitetet i Bergen (Norway)
Verified email at uib.no - Homepage
Title
Cited by
Cited by
Year
A branch and cut algorithm for minimum spanning trees under conflict constraints
P Samer, S Urrutia
Optimization Letters 9 (1), 41-55, 2015
272015
An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices
RA Melo, P Samer, S Urrutia
Computational Optimization and Applications 65 (3), 821-844, 2016
82016
Um algoritmo de branch and cut para árvores geradoras mınimas sob restriçoes de conflito
P Samer, S Urrutia
XLV Simpósio Brasileiro de Pesquisa Operacional, 2521-2532, 2013
42013
The matching relaxation for a class of generalized set partitioning problems
P Samer, E Cavalcante, S Urrutia, J Oppen
Discrete Applied Mathematics 253, 153-166, 2019
22019
The Unsuitable Neighbourhood Inequalities for the Fixed Cardinality Stable Set Polytope
P Samer, D Haugland
Graphs and Combinatorial Optimization: from Theory to Applications: CTW2020 …, 2021
12021
Fixed cardinality stable sets
P Samer, D Haugland
Discrete Applied Mathematics, 2021
2021
Combinatorial Relaxation Bounds and Preprocessing for Berth Allocation Problems
E Cavalcante, J Oppen, P Samer, S Urrutia
Electronic Notes in Discrete Mathematics 55 (CTW 2016), 85-88, 2016
2016
Uma metodologia de relaxação combinatória para um problema de logística em portos
E Cavalcante, J Oppen, P Samer, S Urrutia
XLVIII Simpósio Brasileiro de Pesquisa Operacional (SBPO), 2539-2550, 2016
2016
Projeto de uma Biblioteca Paralela de Grafos
P Samer, AH Sampaio, A Milanés, S Urrutia
XVI Congreso Latino-Iberoamericano de Investigación Operativa / XLIV …, 2012
2012
Designing a Multicore Graph Library
P Samer, AH Sampaio, A Milanés, S Urrutia
10th IEEE International Symposium on Parallel and Distributed Processing …, 2012
2012
The system can't perform the operation now. Try again later.
Articles 1–10