|
![]() |
|||
|
||||
OverviewThis volume can be considered as a supplementary volume to the major 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. Audience: All those who use combinatorial optimization methods to model and solve problems. Full Product DetailsAuthor: Ding-Zhu Du , Panos M. PardalosPublisher: Springer-Verlag New York Inc. Imprint: Springer-Verlag New York Inc. Edition: Softcover reprint of hardcover 1st ed. 1999 Dimensions: Width: 16.00cm , Height: 3.30cm , Length: 24.00cm Weight: 0.997kg ISBN: 9781441948137ISBN 10: 1441948139 Pages: 648 Publication Date: 03 December 2010 Audience: Professional and scholarly , Professional & Vocational Format: Paperback Publisher's Status: Active Availability: Out of stock ![]() The supplier is temporarily out of stock of this item. It will be ordered for you on backorder and shipped when it becomes available. Table of ContentsThe 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.ReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |