IDEAS home Printed from https://ideas.repec.org/p/cor/louvrp/1236.html
   My bibliography  Save this paper

Formulations and valid inequalities for the node capacitated graph partitioning problem

Author

Listed:
  • FERREIRA, C. E.
  • MARTIN, A.
  • de SOUZA, C. C.
  • WEISMANTEL, R.

Abstract

No abstract is available for this item.

Suggested Citation

  • FERREIRA, C. E. & MARTIN, A. & de SOUZA, C. C. & WEISMANTEL, R., 1996. "Formulations and valid inequalities for the node capacitated graph partitioning problem," LIDAM Reprints CORE 1236, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    • Handle: RePEc:cor:louvrp:1236
    DOI: 10.1007/BF02592198
    Note: In : Mathematical Programming, 74, 247-266, 1996
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1007/BF02592198
    Download Restriction: no
    File URL: https://libkey.io/10.1007/BF02592198?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

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


    Cited by:

    1. W. David Pisinger & Anders Bo Rasmussen & Rune Sandvik, 2007. "Solution of Large Quadratic Knapsack Problems Through Aggressive Reduction," INFORMS Journal on Computing, INFORMS, vol. 19(2), pages 280-290, May.
    2. Burak Kocuk & Hyemin Jeon & Santanu S. Dey & Jeff Linderoth & James Luedtke & Xu Andy Sun, 2016. "A Cycle-Based Formulation and Valid Inequalities for DC Power Transmission Problems with Switching," Operations Research, INFORMS, vol. 64(4), pages 922-938, August.
    3. Michael M. Sørensen, 2004. "b-Tree Facets for the Simple Graph Partitioning Polytope," Journal of Combinatorial Optimization, Springer, vol. 8(2), pages 151-170, June.
    4. Anuj Mehrotra & Joseph Shantz & Michael A. Trick, 2005. "Determining newspaper marketing zones using contiguous clustering," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(1), pages 82-92, February.
    5. C. Helmberg & F. Rendl & R. Weismantel, 2000. "A Semidefinite Programming Approach to the Quadratic Knapsack Problem," Journal of Combinatorial Optimization, Springer, vol. 4(2), pages 197-215, June.
    6. John E. Mitchell, 2003. "Realignment in the National Football League: Did they do it right?," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(7), pages 683-701, October.
    7. 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.

    More about this item

    Statistics

    Access and download statistics

    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:cor:louvrp:1236. 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: Alain GILLIS (email available below). General contact details of provider: https://edirc.repec.org/data/coreebe.html .

    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.