Partitions

Optimality and ClusteringVol II: Multi-Parameter

Nonfiction, Science & Nature, Mathematics, Applied
Cover of the book Partitions by Frank K Hwang, Uriel G Rothblum, Hong-Bin Chen, World Scientific Publishing Company
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: Frank K Hwang, Uriel G Rothblum, Hong-Bin Chen ISBN: 9789814412360
Publisher: World Scientific Publishing Company Publication: April 24, 2013
Imprint: WSPC Language: English
Author: Frank K Hwang, Uriel G Rothblum, Hong-Bin Chen
ISBN: 9789814412360
Publisher: World Scientific Publishing Company
Publication: April 24, 2013
Imprint: WSPC
Language: English

The need for optimal partition arises from many real-world 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 well-known 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 well-known 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.

Contents:

  • Bounded-Shape Sum-Partition Problems: Polyhedral Approach
  • Constrained-Shape and Single-Size Sum-Partition Problems: Polynomial Approach
  • Partitions over Multi-Parameter Spaces: Combinatorial Structure
  • Clustering Problems over Multi-Parameter Spaces
  • Sum-Multipartition Problems over Single-Parameter Spaces
  • Applications

Readership: Researchers and practitioners in computer science, operations research, applied mathematics and industrial engineering.
Key Features:

  • A significant part of the theory has been developed by the authors and their co-workers
  • Not just a theoretical treatment of the subject, but also has a discussion on many practical and well-known problems such as the clustering problem to which the developed theory can apply (or explanations why it doesn't)
  • Can also be used as a text for a 1-year graduate class
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

The need for optimal partition arises from many real-world 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 well-known 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 well-known 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.

Contents:

Readership: Researchers and practitioners in computer science, operations research, applied mathematics and industrial engineering.
Key Features:

More books from World Scientific Publishing Company

Cover of the book Method of Lines Analysis of Turing Models by Frank K Hwang, Uriel G Rothblum, Hong-Bin Chen
Cover of the book The Quantum World by Frank K Hwang, Uriel G Rothblum, Hong-Bin Chen
Cover of the book Recent Advances in Applied Nonlinear Dynamics with Numerical Analysis by Frank K Hwang, Uriel G Rothblum, Hong-Bin Chen
Cover of the book CO2 Sequestration by Ex-Situ Mineral Carbonation by Frank K Hwang, Uriel G Rothblum, Hong-Bin Chen
Cover of the book Ancient Silk Trade Routes by Frank K Hwang, Uriel G Rothblum, Hong-Bin Chen
Cover of the book Ethnic Chinese Business in Asia by Frank K Hwang, Uriel G Rothblum, Hong-Bin Chen
Cover of the book Political Participation in Asia by Frank K Hwang, Uriel G Rothblum, Hong-Bin Chen
Cover of the book Market Microstructure in Practice by Frank K Hwang, Uriel G Rothblum, Hong-Bin Chen
Cover of the book Anomaly! Collider Physics and the Quest for New Phenomena at Fermilab by Frank K Hwang, Uriel G Rothblum, Hong-Bin Chen
Cover of the book Lipschitz Algebras by Frank K Hwang, Uriel G Rothblum, Hong-Bin Chen
Cover of the book Regional Development and Economic Growth in China by Frank K Hwang, Uriel G Rothblum, Hong-Bin Chen
Cover of the book A First Course in Integral Equations by Frank K Hwang, Uriel G Rothblum, Hong-Bin Chen
Cover of the book From Photons to Higgs by Frank K Hwang, Uriel G Rothblum, Hong-Bin Chen
Cover of the book The Theory of Chinese Medicine by Frank K Hwang, Uriel G Rothblum, Hong-Bin Chen
Cover of the book Singapore's Health Care System by Frank K Hwang, Uriel G Rothblum, Hong-Bin Chen
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy