Browsing Department of Informatics by Journals "Optimization Letters"
Now showing items 1-1 of 1
-
Polyhedral results and stronger Lagrangean bounds for stable spanning trees
(Journal article; Peer reviewed, 2023)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 {ei,ej}∈C, at most one of the ...