IIMA Institutional Repository
This Institutional Repository has been created to collect, preserve and distribute the scholarly output of Indian Institute of Management, Ahmedabad. This will work as an important tool to facilitate scholarly communication and preserve the institution knowledge. The Vikram Sarabhai Library is proud to be hosting the repository for the dissemination and preservation of this valuable knowledge resource of the IIMA community.
Please use this identifier to cite or link to this item:
http://hdl.handle.net/11718/759Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Goldengorin, Boris | - |
| dc.contributor.author | Ghosh, Diptesh | - |
| dc.date.accessioned | 2010-01-16T10:55:03Z | - |
| dc.date.available | 2010-01-16T10:55:03Z | - |
| dc.date.copyright | 2002-06 | - |
| dc.date.issued | 2010-01-16T10:55:03Z | - |
| dc.identifier.uri | http://hdl.handle.net/11718/759 | - |
| dc.description.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 | en |
| dc.language.iso | en | en |
| dc.relation.ispartofseries | W.P.;1704 | - |
| dc.subject | Data Correcting Algorithm | en |
| dc.subject | Hasse diagram | en |
| dc.subject | Multilevel Search | en |
| dc.title | Data-correcting algorithm for the maximization of submodular functions: a multilevel search in the hasse diagram | en |
| dc.type | Working Paper | en |
| 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.