Data correcting algorithms for combinatorial optimization by Boris Goldengorin, Diptesh Ghosh and Gerard Sierksma (Working Paper, No. 2004-04-05/1808) Goldengorin, Boris

By: Goldengorin, Boris
Contributor(s): Ghosh, Diptesh | Sierksma, Gerard
Material type: TextTextPublisher: Ahmedabad Indian Institute of Management 2004Description: 50 p.Subject(s): Combanatorial analysis | Algorithms | Mathematical optimizationDDC classification: WP 2004-04-05 (1808) Summary: This paper describes data correcting algorithms. It provides the theory behind the algorithms and presents the implementation details and computational experience with these algorithms on the asymmetric traveling salesperson problem, the problem of maximizing sub-modular functions, and the simple plant location problem.
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current location Call number Status Date due Barcode
Working Paper Vikram Sarabhai Library
WP 2004-04-05 (1808) (Browse shelf) Available WP001808

This paper describes data correcting algorithms. It provides the theory behind the algorithms and presents the implementation details and computational experience with these algorithms on the asymmetric traveling salesperson problem, the problem of maximizing sub-modular functions, and the simple plant location problem.

There are no comments for this item.

to post a comment.

Powered by Koha