Solving large instances of the quadratic cost of partition problem on dense graphs by data correcting algorithms
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.
|Date of creation:||1999|
|Date of revision:|
|Contact details of provider:|| Postal: |
Phone: +31 50 363 7185
Fax: +31 50 363 3720
Web page: http://som.eldoc.ub.rug.nl/
More information through EDIRC
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.:
- Boris Goldengorin & Gerard Sierksma & Gert A. Tijssen & Michael Tso, 1999. "The Data-Correcting Algorithm for the Minimization of Supermodular Functions," Management Science, INFORMS, vol. 45(11), pages 1539-1551, November.
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 references are entirely missing, you can add them using this form.