Phillippe Samer

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 13

Top Topics

Undirected Graph

Minimum Spanning Trees

Allocation Problems

Top Venues

Discret. Appl. Math.

Electron. Notes Discret. Math.

Publications

Phillippe Samer, Phablo F. S. Moura
Polyhedral approach to weighted connected matchings in general graphs. Discret. Appl. Math. 359 (2024)
Phillippe Samer, Dag Haugland
Polyhedral results and stronger Lagrangean bounds for stable spanning trees. Optim. Lett. 17 (6) (2023)
Phillippe Samer
On a class of strong valid inequalities for the connected matching polytope. CoRR (2023)
Phillippe Samer, Phablo F. S. Moura
Polyhedral approach to weighted connected matchings in general graphs. CoRR (2023)
Phillippe Samer, Dag Haugland
Towards Stronger Lagrangean Bounds for Stable Spanning Trees. INOC (2022)
Phillippe Samer, Dag Haugland
Polyhedral results and stronger Lagrangean bounds for stable spanning trees. CoRR (2022)
Phillippe Samer, Dag Haugland
Fixed cardinality stable sets. Discret. Appl. Math. 303 (2021)
Phillippe Samer, Evellyn Cavalcante, Sebastián Urrutia, Johan Oppen
The matching relaxation for a class of generalized set partitioning problems. Discret. Appl. Math. 253 (2019)
Rafael A. Melo, Phillippe Samer, Sebastián Urrutia
An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices. Comput. Optim. Appl. 65 (3) (2016)
Evellyn Cavalcante, Johan Oppen, Phillippe Samer, Sebastián Urrutia
A combinatorial relaxation methodology for berth allocation problems. CoRR (2016)
Evellyn Cavalcante, Johan Oppen, Phillippe Samer, Sebastián Urrutia
Combinatorial Relaxation Bounds and Preprocessing for Berth Allocation Problems. Electron. Notes Discret. Math. 55 (2016)
Phillippe Samer, Sebastián Urrutia
A branch and cut algorithm for minimum spanning trees under conflict constraints. Optim. Lett. 9 (1) (2015)
Rafael A. Melo, Phillippe Samer, Sebastián Urrutia
An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices. CoRR (2015)
Phillippe Samer, Sebastián Urrutia
A branch and cut algorithm for minimum spanning trees under conflict constraints. CoRR (2013)
Phillippe Samer, Afonso H. Sampaio, Anolan Milanés, Sebastián Urrutia
Designing a Multicore Graph Library. ISPA (2012)