Skip to main content
SpringerLink
Log in

Multiset graph partitioning

  • Published:
Mathematical Methods of Operations Research Aims and scope Submit manuscript

Abstract.

Local optimality conditions are given for a quadratic programming formulation of the multiset graph partitioning problem. These conditions are related to the structure of the graph and properties of the weights.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Florida, Gainesville, FL 32611 (e-mail: hager@math.ufl.edu, http://www.math.ufl.edu/∼hager), , , , , , US

    William W. Hager & Yaroslav Krylyuk

Authors
  1. William W. Hager
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yaroslav Krylyuk
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Manuscript received: March 2001/Final version received: October 2001

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hager, W., Krylyuk, Y. Multiset graph partitioning. Mathematical Methods of OR 55, 1–10 (2002). https://doi.org/10.1007/s001860200173

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s001860200173

Search

Navigation