Data-correcting algorithm for the maximization of submodular functions: a multilevel search in the hasse diagram by Boris Goldengorin and D Gosh (Working Paper, No. 2002-06-02/1704

By: Contributor(s): Material type: TextTextPublication details: Ahmedabad Indian Institute of Management 2002 Description: 20 pDDC classification:
  • WP 2002-06-02 (1704)
Summary: 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
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Call number Status Date due Barcode
Working Paper Vikram Sarabhai Library WP 2002-06-02 (1704) (Browse shelf(Opens below)) Available WP001704

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

There are no comments on this title.

to post a comment.