Phillippe Samer

Available identifiers

Publication	Date of Publication	Type
Polyhedral approach to weighted connected matchings in general graphs	2024-11-06	Paper
Polyhedral approach to weighted connected matchings in general graphs	2023-10-09	Paper
On a class of strong valid inequalities for the connected matching polytope	2023-09-25	Paper
Polyhedral results and stronger Lagrangean bounds for stable spanning trees	2023-07-06	Paper
The unsuitable neighbourhood inequalities for the fixed cardinality stable set polytope	2021-12-08	Paper
Fixed cardinality stable sets	2021-09-15	Paper
The matching relaxation for a class of generalized set partitioning problems	2018-12-18	Paper
Combinatorial relaxation bounds and preprocessing for berth allocation problems	2017-02-14	Paper
An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices	2016-12-15	Paper
A branch and cut algorithm for minimum spanning trees under conflict constraints	2015-02-23	Paper

This page was built for person: Phillippe Samer