Handbook of Combinatorial Optimization: Supplement Volume A
Author:   Ding-Zhu Du ,  Panos M. Pardalos
Publisher:   Springer
Edition:   1999 ed.
ISBN:  

9780792359241


Pages:   648
Publication Date:   31 October 1999
Format:   Hardback
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Our Price $488.40 Quantity:  
Add to Cart

Share |

Handbook of Combinatorial Optimization: Supplement Volume A


Add your own review!

Overview

This volume can be considered as a supplementary volume to the three-volume ""Handbook of Combinatorial Optimization"" published by Kluwer. 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. This handbook deals with several algorithmic approaches for discrete problems as well as with many combinatorial optimization problems. Each chapter in the handbook is expository in nature, but scholarly in treatment. The book is addressed not only to researchers in discrete optimization, but to all scientists in various disciplines who use combinatorial optimization methods to model and solve problems.

Full Product Details

Author:   Ding-Zhu Du ,  Panos M. Pardalos
Publisher:   Springer
Imprint:   Springer
Edition:   1999 ed.
Dimensions:   Width: 15.60cm , Height: 3.40cm , Length: 23.40cm
Weight:   2.420kg
ISBN:  

9780792359241


ISBN 10:   0792359240
Pages:   648
Publication Date:   31 October 1999
Audience:   College/higher education ,  Professional and scholarly ,  Undergraduate ,  Postgraduate, Research & Scholarly
Format:   Hardback
Publisher's Status:   Active
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Table of Contents

The Maximum Clique Problem.- Linear Assignment Problems and Extensions.- Bin Packing Approximation Algorithms: Combinatorial Analysis.- Feedback Set Problems.- Neural Networks Approaches for Combinatorial Optimization Problems.- Frequency Assignment Problems.- Algorithms for the Satisfiability (SAT) Problem.- The Steiner Ratio of Lp-planes.- A Cogitative Algorithm for Solving the Equal Circles Packing Problem.- Author Index.

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

MRG2025CC

 

Shopping Cart
Your cart is empty
 Shopping cart
Mailing List

 

Sign up now