Welcome to P K Kelkar Library, Online Public Access Catalogue (OPAC)

Normal view MARC view ISBD view

Handbook of Combinatorial Optimization : Supplement Volume B /

Contributor(s): Du, Ding-Zhu [editor.] | Pardalos, Panos M [editor.] | SpringerLink (Online service).
Material type: materialTypeLabelBookPublisher: Boston, MA : Springer US, 2005.Description: VIII, 394 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9780387238302.Subject(s): Mathematics | Computer science | System theory | Operations research | Management science | Combinatorics | Mathematics | Operations Research, Management Science | Combinatorics | Systems Theory, Control | Computer Science, generalDDC classification: 519.6 Online resources: Click here to access online
Contents:
Data Correcting Algorithms in Combinatorial Optimization -- The Steiner Ratio of Banach-Minkowski spaces - A Survey -- Probabilistic Verification and Non-Approximability -- Steiner Trees in Industry -- Network-based Models and Algorithms in Data Mining and Knowledge Discovery -- The Generalized Assignment Problem and Extensions -- Optimal Rectangular Partitions -- Connected Dominating Set in Sensor Networks and MANETs.
In: Springer eBooksSummary: This is a supplementary volume to the major three-volume Handbook of Combinatorial Optimization set, as well as the Supplement Volume A. It can also be regarded as a stand-alone volume which presents chapters dealing with various aspects of the subject, including optimization problems and algorithmic approaches for discrete problems. Audience This handbook is suitable for all those who use combinatorial optimization methods to model and solve problems.
    average rating: 0.0 (0 votes)
Item type Current location Call number Status Date due Barcode Item holds
E books E books PK Kelkar Library, IIT Kanpur
Available EBK6226
Total holds: 0

Data Correcting Algorithms in Combinatorial Optimization -- The Steiner Ratio of Banach-Minkowski spaces - A Survey -- Probabilistic Verification and Non-Approximability -- Steiner Trees in Industry -- Network-based Models and Algorithms in Data Mining and Knowledge Discovery -- The Generalized Assignment Problem and Extensions -- Optimal Rectangular Partitions -- Connected Dominating Set in Sensor Networks and MANETs.

This is a supplementary volume to the major three-volume Handbook of Combinatorial Optimization set, as well as the Supplement Volume A. It can also be regarded as a stand-alone volume which presents chapters dealing with various aspects of the subject, including optimization problems and algorithmic approaches for discrete problems. Audience This handbook is suitable for all those who use combinatorial optimization methods to model and solve problems.

There are no comments for this item.

Log in to your account to post a comment.

Powered by Koha