Advanced Search
MyIDEAS: Login to save this paper or follow this series

Solving large instances of the quadratic cost of partition problem on dense graphs by data correcting algorithms

Contents:

Author Info

  • Goldengorin, Boris
  • Vink, Marius de

    (Groningen University)

Abstract

The Data-Correcting Algorithm (DCA) corrects the data of a hard problem instance in such a way that we obtain an instance of a well solvable special case. For a given prescribed accuracy of the solution, the DCA uses a branch and bound scheme to make sure that the solution of the corrected instance satisfies this given prescribed accuracy. We describe the "hardness" of randomly generated instances of the Quadratic Cost Partition Problem (QCP) by the density of the corresponding graphs as well as by the cardinality of an optimal solution of the QCP. We study the behaviour of the DCAs through the number of search levels of the so called Preliminary Preservation Al-gorithm and average computational times. We report average computational times of the DCA for instances of dense graphs with the number of vertices up to 500 which can be solved on a standard PC within 10 minutes.

Download Info

If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
File URL: http://irs.ub.rug.nl/ppn/188210458
Download Restriction: no

Bibliographic Info

Paper provided by University of Groningen, Research Institute SOM (Systems, Organisations and Management) in its series Research Report with number 99A50.

as in new window
Length:
Date of creation: 1999
Date of revision:
Handle: RePEc:dgr:rugsom:99a50

Contact details of provider:
Postal: PO Box 800, 9700 AV Groningen
Phone: +31 50 363 7185
Fax: +31 50 363 3720
Email:
Web page: http://som.eldoc.ub.rug.nl/
More information through EDIRC

Related research

Keywords:

This paper has been announced in the following NEP Reports:

References

References listed on IDEAS
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.:
as in new window
  1. Boris Goldengorin & Gerard Sierksma & Gert A. Tijssen & Michael Tso, 1999. "The Data-Correcting Algorithm for the Minimization of Supermodular Functions," Management Science, INFORMS, INFORMS, vol. 45(11), pages 1539-1551, November.
Full references (including those not matched with items on IDEAS)

Citations

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:dgr:rugsom:99a50. See general information about how to correct material in RePEc.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Joke Bulthuis).

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.

If references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with 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 profile, as there may be some citations waiting for confirmation.

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