Please use this identifier to cite or link to this item:
http://hdl.handle.net/11718/759
Title: | Data-correcting algorithm for the maximization of submodular functions: a multilevel search in the hasse diagram |
Authors: | Goldengorin, Boris Ghosh, Diptesh |
Keywords: | Data Correcting Algorithm;Hasse diagram;Multilevel Search |
Issue Date: | 16-Jan-2010 |
Series/Report no.: | W.P.;1704 |
Abstract: | The Data Correcting Algorithm (DCA) is a recursive branch and bound type algorithm, in which the data of a given instance is heuristically corrected at each branching in such a way that the new instance will be as close as possible to polynomially solvable and the optimal solution to the corrected instance satisfies a prescribed accuracy condition |
URI: | http://hdl.handle.net/11718/759 |
Appears in Collections: | Working Papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
WP 2002_1704.pdf | 1.32 MB | Adobe PDF | View/Open |
Items in IIMA Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.