Phillippe Samer

According to our database, Phillippe Samer authored at least 11 papers between 2012 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2024

Polyhedral approach to weighted connected matchings in general graphs.

Phillippe Samer, Phablo F. S. Moura

Discret. Appl. Math., 2024

2023

Polyhedral results and stronger Lagrangean bounds for stable spanning trees.

Phillippe Samer, Dag Haugland

Optim. Lett., July, 2023

On a class of strong valid inequalities for the connected matching polytope.

Phillippe Samer

CoRR, 2023

2022

Towards Stronger Lagrangean Bounds for Stable Spanning Trees.

Phillippe Samer, Dag Haugland

Proceedings of the 10th International Network Optimization Conference, 2022

2021

Fixed cardinality stable sets.

Phillippe Samer, Dag Haugland

Discret. Appl. Math., 2021

2019

The matching relaxation for a class of generalized set partitioning problems.

Phillippe Samer, Evellyn Cavalcante, Sebastián Urrutia, Johan Oppen

Discret. Appl. Math., 2019

2016

Combinatorial Relaxation Bounds and Preprocessing for Berth Allocation Problems.

Evellyn Cavalcante, Johan Oppen, Phillippe Samer, Sebastián Urrutia

Electron. Notes Discret. Math., 2016

A combinatorial relaxation methodology for berth allocation problems.

Evellyn Cavalcante, Johan Oppen, Phillippe Samer, Sebastián Urrutia

CoRR, 2016

An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices.

Rafael A. Melo, Phillippe Samer, Sebastián Urrutia

Comput. Optim. Appl., 2016

2015

A branch and cut algorithm for minimum spanning trees under conflict constraints.

Phillippe Samer, Sebastián Urrutia

Optim. Lett., 2015

2012

Designing a Multicore Graph Library.

Phillippe Samer, Afonso H. Sampaio, Anolan Milanés, Sebastián Urrutia

Proceedings of the 10th IEEE International Symposium on Parallel and Distributed Processing with Applications, 2012