stable multi-sets

Polyhedral investigations on stable multi-sets

  • Arie M.C.A. Koster
  • Adrian Zymolka
    • Categories Branch and Cut Algorithms, Graphs and Matroids, Polyhedra Tags , ,

    Stable multi-sets are an evident generalization of the well-known stable sets. As integer programs, they constitute a general structure which allows for a wide applicability of the results. Moreover, the study of stable multi-sets provides new insights to well-known properties of stable sets. In this paper, we continue our investigations started in Koster and Zymolka … Read more

    Stable Multi-Sets

  • Arie M.C.A. Koster
  • Adrian Zymolka
    • Categories Graphs and Matroids, Polyhedra Tags ,

    In this paper we introduce a generalization of stable sets: stable multi-sets. A stable multi-set is an assignment of integers to the vertices of a graph, such that specified bounds on vertices and edges are not exceeded. In case all vertex and edge bounds equal one, stable multi-sets are equivalent to stable sets. For the … Read more