Download Info

To our knowledge, this item is not available for download. To find whether it is available, there are three options:
1. Check below under "Related research" 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.

Publisher Info

Paper provided by University of Aarhus, Aarhus School of Business, Department of Management Science and Logistics in its series Working Papers with number 00-3.

Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Length: 31 pages
Date of creation: 01 Jan 2000
Date of revision:
Handle: RePEc:hhb:aarmsl:2000_003

Contact details of provider:
Postal: The Aarhus School of Business, Fuglesangs Allé 4, DK-8210 Aarhus V, Denmark
Phone: +45 89 48 66 88
Fax: + 45 86 15 01 88
Web page: http://www.asb.dk/
More information through EDIRC

For technical questions regarding this item, or to correct its listing, contact: (Helle Vinbaek Stenholt).

Related research

Keywords: Clique partitioning; Clustering; Graph partitioning; Multicuts; Polyhedral combinatorics;

Cited by:
(explanations, Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.)

1. Sørensen, Michael M., 2005. "Polyhedral Computations for the Simple Graph Partitioning Problem," CORAL Working Papers L-2005-02, University of Aarhus, Aarhus School of Business, Department of Business Studies. [Downloadable!]

Did you know? No RePEc service, like IDEAS, charges for the use or the display of bibliographic data.

This page was last updated on 2009-12-23.