Partitions : optimality and clustering
 Author/Creator
 Hwang, Frank.
 Language
 English.
 Imprint
 Singapore ; Hackensack, NJ : World Scientific, c2012
 Physical description
 v. : ill ; 24 cm.
 Series
 Series on applied mathematics ; v. 1920.
Access
Available online

Stacks
 Library has: v.1

Unknown
QA165 .H83 2012 V.1
More options
Contributors
 Contributor
 Rothblum, Uriel G.
Contents/Summary
 Bibliography
 Includes bibliographical references and index.
 Contents

 Formulation and Examples SumPartition Problems over Single Parameter Spaces: Explicit Solutions Extreme Points and Optimization Permutation Polytopes SumPartition Problems over Single Parameter Spaces: Polyhedral Approach Partitions over Single Parameter Spaces: Combinatorial Analysis Partition Problems over Single Parameter Spaces: Combinatorial Approach SumMultipartition Problems over Single Parameter Spaces SumPartition Problems over MultiParameter Spaces: Polyhedral Approach Partition Problems over MultiParameter Spaces: Combinatorial Approach Applications Partition Bargaining Games/Maximizing Concave Functions over Partition Polytopes.
 (source: Nielsen Book Data)
 Publisher's Summary
 The need of optimal partition arises from many realworld problems involving the distribution of limited resources to many users. The "clustering" problem, which has recently received a lot of attention, is a special case of optimal partitioning. This book is the first attempt to collect all theoretical developments of optimal partitions, many of them derived by the authors, in an accessible place for easy reference. Much more than simply collecting the results, the book provides a general framework to unify these results and present them in an organized fashion.Many wellknown practical problems of optimal partitions are dealt with. The authors show how they can be solved using the theory  or why they cannot be. These problems include: allocation of components to maximize system reliability; experiment design to identify defectives; design of circuit card library and of blood analyzer lines; abstraction of finite state machines and assignment of cache items to pages; the division of property and partition bargaining as well as touching on those wellknown research areas such as scheduling, inventory, nearest neighbor assignment, the traveling salesman problem, vehicle routing, and graph partitions. The authors elucidate why the last three problems cannot be solved in the context of the theory.
(source: Nielsen Book Data)
Subjects
 Subject
 Partitions (Mathematics)
Bibliographic information
 Beginning date
 2012
 Responsibility
 Frank K. Hwang, Uriel G. Rothblum.
 Series
 Series on applied mathematics ; v. 1920
 ISBN
 9789812708120
 981270812X
 9789814412346
 9814412341