Blar i Department of Informatics på emneord "Kombinatorisk optimalisering"

Viser treff 1-2 av 2

    • Fixed cardinality stable sets 

      Samer, Phillippe; Haugland, Dag (Journal article; Peer reviewed, 2021)
      Given an undirected graph G=(V,E) and a positive integer k in {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 ...

    • Towards stronger Lagrangean bounds for stable spanning trees 

      Samer, Phillippe; Haugland, Dag (Chapter, 2022)
      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 {e_i, e_j} in C, at most one ...