Bibliothek

X
feed icon rss

Ihre E-Mail wurde erfolgreich gesendet. Bitte prüfen Sie Ihren Maileingang.

Leider ist ein Fehler beim E-Mail-Versand aufgetreten. Bitte versuchen Sie es erneut.

Vorgang fortführen?

Exportieren
Filter
  • 1990-1994  (2)
  • 1994  (2)
Datenquelle
Erscheinungszeitraum
  • 1990-1994  (2)
Jahr
Schlagwörter
Sprache
  • 1
    facet.materialart.
    Unbekannt
    Formulations and Valid Inequalities for the Node Capacitated Graph Partitioning Problem. (1994)
    Details
    Publikationsdatum: 2021-03-16
    Beschreibung: We investigate the problem of partitioning the nodes of a graph under capacity restriction on the sum of the node weights in each subset of the partition. The objective is to minimize the sum of the costs of the edges between the subsets of the partition. This problem has a variety of applications, for instance in the design of electronic circuits and devices. We present alternative integer programming formulations for this problem and discuss the links between these formulations. Having chosen to work in the space of edges of the multicut, we investigate the convex hull of incidence vectors of feasible multicuts. In particular, several classes of inequalities are introduced, and their strength and robustness are analyzed as various problem parameters change.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    OPUS
  • 2
    facet.materialart.
    Unbekannt
    The Node Capacitated Graph Partitioning Problem: A Computational Study. (1994)
    Details
    Publikationsdatum: 2021-03-16
    Beschreibung: In this paper we consider the problem of $k$-partitioning the nodes of a graph with capacity restrictions on the sum of the node weights in each subset of the partition, and the objective of minimizing the sum of the costs of the edges between the subsets of the partition. Based on a study of valid inequalities, we present a variety of separation heuristics for so-called cycle, cycle with ears, knapsack tree and path-block-cycle inequalities. The separation heuristics, plus primal heuristics, have been implemented in a branch-and-cut routine using a formulation including the edges with nonzero costs and node variables. Results are presented for three classes of problems: equipartitioning problems arising in finite element methods and partitioning problems associated with electronic circuit layout and compiler design.
    Schlagwort(e): ddc:000
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    OPUS
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie hier...