IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-319-07001-8_45.html
   My bibliography  Save this book chapter

Mathematical Formulations for the Acyclic Partitioning Problem

In: Operations Research Proceedings 2013

Author

Listed:
  • Jenny Nossack

    (University of Siegen)

  • Erwin Pesch

    (University of Siegen)

Abstract

This paper addresses the problem of partitioning the vertex set of a given directed, edge- and vertex-weighted graph into disjoint subsets (i.e., clusters). Clusters are to be determined such that the sum of the vertex weights within the clusters satisfies an upper bound and the sum of the edge weights within the clusters is maximized. Additionally, the digraph is enforced to partition into a directed, acyclic graph, i.e., a digraph that contains no directed cycle. This problem is known in the literature as acyclic partitioning problem and is proven to be NP-hard in the strong sense. Real-life applications arise, e.g., at rail-rail transshipment yards and in Very Large Scale Integration (VLSI) design. We propose two model formulations for the acyclic partitioning problem, a compact and an augmented set partitioning model.

Suggested Citation

  • Jenny Nossack & Erwin Pesch, 2014. "Mathematical Formulations for the Acyclic Partitioning Problem," Operations Research Proceedings, in: Dennis Huisman & Ilse Louwerse & Albert P.M. Wagelmans (ed.), Operations Research Proceedings 2013, edition 127, pages 333-339, Springer.
    • Handle: RePEc:spr:oprchp:978-3-319-07001-8_45
    DOI: 10.1007/978-3-319-07001-8_45
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Albareda-Sambola, Maria & Marín, Alfredo & Rodríguez-Chía, Antonio M., 2019. "Reformulated acyclic partitioning for rail-rail containers transshipment," European Journal of Operational Research, Elsevier, vol. 277(1), pages 153-165.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:oprchp:978-3-319-07001-8_45. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.