Multiset graph partitioning

William W. Hager and Yaroslav Krylyuk

Mathematical Methods of Operations Research, 2002, vol. 55, issue 1, 10 pages

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. Copyright Springer-Verlag Berlin Heidelberg 2002

Keywords: Key words: Graph partitioning; min-cut; max-cut; quadratic programming; optimality conditions; AMS(MOS) subject classifications: 90C35; 90C27; 90C20 (search for similar items in EconPapers)
Date: 2002
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://hdl.handle.net/10.1007/s001860200173 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:mathme:v:55:y:2002:i:1:p:1-10

Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/00186

DOI: 10.1007/s001860200173

Access Statistics for this article

Mathematical Methods of Operations Research is currently edited by Oliver Stein

More articles in Mathematical Methods of Operations Research from Springer, Gesellschaft für Operations Research (GOR), Nederlands Genootschap voor Besliskunde (NGB)
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().