Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Phillippe Samer"'
Autor:
Phillippe Samer Lallo Dias
Publikováno v:
Biblioteca Digital de Teses e Dissertações da UFMGUniversidade Federal de Minas GeraisUFMG.
This work presents approaches for the exact solution of the minimum spanning tree problem under conflict constraints. Given a graph G(V,E) and a set C E x E of conflicting edge pairs, the problem consists of finding a conflict-free minimum spanning t
Externí odkaz:
http://hdl.handle.net/1843/ESBF-9KJQNW
Autor:
Dag Haugland, Phillippe Samer
Publikováno v:
Discrete Applied Mathematics
Given an undirected graph G = ( V , E ) and a positive integer k ∈ 1 , … , | V | , we initiate the combinatorial study of stable sets of cardinality exactly k in G . Our aim is to instigate the polyhedral investigation of the convex hull of fixed
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2e3b7b97dd2b781d8bf1224f0d706d34
https://doi.org/10.1016/j.dam.2021.01.019
https://doi.org/10.1016/j.dam.2021.01.019
Autor:
Phillippe Samer, Dag Haugland
Publikováno v:
Optimization Letters
Given a graph $G=(V,E)$ and a set $C$ of unordered pairs of edges regarded as being in conflict, a stable spanning tree in $G$ is a set of edges $T$ inducing a spanning tree in $G$, such that for each $\left\lbrace e_i, e_j \right\rbrace \in C$, at m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fde7e669f084c1af18840ca72dcedeb1
https://hdl.handle.net/11250/3038498
https://hdl.handle.net/11250/3038498
Publikováno v:
Discrete Applied Mathematics. 253:153-166
This paper introduces a discrete relaxation for the class of combinatorial optimization problems which can be described by a set partitioning formulation under packing constraints. We present two combinatorial relaxations based on computing maximum w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::aa094ea9f4fde274c05739c1e76d5501
https://doi.org/10.1016/j.dam.2018.05.033
https://doi.org/10.1016/j.dam.2018.05.033
Autor:
Phillippe Samer, Dag Haugland
Publikováno v:
AIRO Springer Series ISBN: 9783030630713
Given an undirected graph G = (V, E) and an integer \(k \in \left \lbrace 1, \ldots , |V|\right \rbrace \), we initiate the combinatorial study of stable sets of cardinality exactly k in G. Our aim is to instigate the polyhedral investigation of the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::993f0388e85e3457992da0828ebd7148
https://hdl.handle.net/11250/2761120
https://hdl.handle.net/11250/2761120
Publikováno v:
Electronic Notes in Discrete Mathematics. 55:85-88
We investigate an optimization problem in container ports, for which previous models based on generalized set partitioning formulations have been studied. We describe two combinatorial relaxations based on computing maximum weighted matchings in suit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::287abda68051195b7888795990bb4c23
https://doi.org/10.1016/j.endm.2016.10.022
https://doi.org/10.1016/j.endm.2016.10.022
Autor:
Sebastián Urrutia, Phillippe Samer
We study approaches for the exact solution of the NP-hard minimum spanning tree problem under conflict constraints. Given a graph \(G(V,E)\) and a set \(C \subset E \times E\) of conflicting edge pairs, the problem consists of finding a conflict-free
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::65a5c4cc9dbdb7710bb1a565d79290c2
Publikováno v:
ISPA
Graph Theory provides a set of powerful tools (both theorems and algorithms) for problem modeling and solving in numerous domains. Though there are several libraries implementing graph algorithms and targeting different platforms and users, few of th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b34c4502da996638973a901609ab8b56
https://doi.org/10.1109/ispa.2012.106
https://doi.org/10.1109/ispa.2012.106