Data-correcting algorithm for the maximization of submodular functions: a multilevel search in the hasse diagram

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