Partitions, Vol. II, Multi-parameter: optimality and clustering
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Singapore
World Scientific Pub. Co.
c2013
|
| Schriftenreihe: | Series on applied mathematics
v. 20 |
| Schlagworte: | |
| Online-Zugang: | FAW01 FAW02 Volltext |
| Beschreibung: | Includes bibliographical references (p. 283-288) and index 1. Bounded-shape sum-partition problems: polyhedral approach. 1.1. Linear objective: solution by LP. 1.2. Enumerating vertices of the partition polytopes and corresponding partitions using edge-directions. 1.3. Representation, characterization and enumeration of vertices of partition polytopes: distinct partitioned vectors. 1.4. Representation, characterization and enumeration of vertices of partition polytopes: general case. 2. Constrained-shape and single-size sum-partition problems: polynomial approach. 2.1. Constrained-shape partition polytopes and (almost-) separable partitions. 2.2. Enumerating separable and limit-separable partitions of constrained-shape. 2.3. Single-size partition polytopes and cone-separable partitions. 2.4. Enumerating (limit-) cone-separable partitions -- - 3. Partitions over multi-parameter spaces: combinatorial structure. 3.1. Properties of partitions. 3.2. Counting and enumerating partition classes of single-size. 3.3. Consistency and sortability of particular partition-properties -- 4. Clustering problems over multi-parameter spaces. 4.1. Geometric properties of optimal partitions. 4.2. Geometric properties of optimal partitions for d = 2 -- 5. Sum-multipartition problems over single-parameter spaces. 5.1. Multipartitions. 5.2. Single-multishape multipartition polytopes. 5.3. Constrained-multishape multipartition polytopes. 5.4. Combinatorial properties of multipartitions. 5.5. Constrained-multishape multipartition problems with asymmetric Schur convex objective: optimization over multipartition polytopes. 5.6. Sum multipartition problems: explicit solutions -- - 6. Applications. 6.1. Assembly of systems. 6.2. Group testing. 6.3. Circuit card library. 6.4. Clustering. 6.5. Abstraction of finite state machines. 6.6. Multischeduling. 6.7. Cache assignment. 6.8. The blood analyzer problem. 6.9. Joint replenishment of inventory. 6.10. Statistical hypothesis testing. 6.11. Nearest neighbor assignment. 6.12. Graph partitions. 6.13. The traveling salesman problem. 6.14. Vehicle routing. 6.15. Division of property. 6.16. The consolidation of farmland 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 |
| Beschreibung: | 1 Online-Ressource (x, 291 p.) |
| ISBN: | 9789814412346 9789814412353 981441235X |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV043106288 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 151126s2013 |||| o||u| ||||||eng d | ||
| 020 | |a 9789814412346 |9 978-981-4412-34-6 | ||
| 020 | |a 9789814412353 |c electronic bk. |9 978-981-4412-35-3 | ||
| 020 | |a 981441235X |c electronic bk. |9 981-4412-35-X | ||
| 035 | |a (OCoLC)844311189 | ||
| 035 | |a (DE-599)BVBBV043106288 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-1046 |a DE-1047 | ||
| 082 | 0 | |a 512.73 |2 22 | |
| 100 | 1 | |a Hwang, Frank |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Partitions, Vol. II, Multi-parameter |b optimality and clustering |c Frank K Hwang, Uriel G Rothblum, Hong-Bin Chen |
| 264 | 1 | |a Singapore |b World Scientific Pub. Co. |c c2013 | |
| 300 | |a 1 Online-Ressource (x, 291 p.) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Series on applied mathematics |v v. 20 | |
| 500 | |a Includes bibliographical references (p. 283-288) and index | ||
| 500 | |a 1. Bounded-shape sum-partition problems: polyhedral approach. 1.1. Linear objective: solution by LP. 1.2. Enumerating vertices of the partition polytopes and corresponding partitions using edge-directions. 1.3. Representation, characterization and enumeration of vertices of partition polytopes: distinct partitioned vectors. 1.4. Representation, characterization and enumeration of vertices of partition polytopes: general case. 2. Constrained-shape and single-size sum-partition problems: polynomial approach. 2.1. Constrained-shape partition polytopes and (almost-) separable partitions. 2.2. Enumerating separable and limit-separable partitions of constrained-shape. 2.3. Single-size partition polytopes and cone-separable partitions. 2.4. Enumerating (limit-) cone-separable partitions -- | ||
| 500 | |a - 3. Partitions over multi-parameter spaces: combinatorial structure. 3.1. Properties of partitions. 3.2. Counting and enumerating partition classes of single-size. 3.3. Consistency and sortability of particular partition-properties -- 4. Clustering problems over multi-parameter spaces. 4.1. Geometric properties of optimal partitions. 4.2. Geometric properties of optimal partitions for d = 2 -- 5. Sum-multipartition problems over single-parameter spaces. 5.1. Multipartitions. 5.2. Single-multishape multipartition polytopes. 5.3. Constrained-multishape multipartition polytopes. 5.4. Combinatorial properties of multipartitions. 5.5. Constrained-multishape multipartition problems with asymmetric Schur convex objective: optimization over multipartition polytopes. 5.6. Sum multipartition problems: explicit solutions -- | ||
| 500 | |a - 6. Applications. 6.1. Assembly of systems. 6.2. Group testing. 6.3. Circuit card library. 6.4. Clustering. 6.5. Abstraction of finite state machines. 6.6. Multischeduling. 6.7. Cache assignment. 6.8. The blood analyzer problem. 6.9. Joint replenishment of inventory. 6.10. Statistical hypothesis testing. 6.11. Nearest neighbor assignment. 6.12. Graph partitions. 6.13. The traveling salesman problem. 6.14. Vehicle routing. 6.15. Division of property. 6.16. The consolidation of farmland | ||
| 500 | |a 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 | ||
| 650 | 7 | |a MATHEMATICS / Number Theory |2 bisacsh | |
| 650 | 7 | |a Partitions (Mathematics) |2 fast | |
| 650 | 4 | |a Partitions (Mathematics) | |
| 700 | 1 | |a Rothblum, Uriel G. |e Sonstige |4 oth | |
| 700 | 1 | |a Chen, Hong-Bin |e Sonstige |4 oth | |
| 710 | 2 | |a World Scientific (Firm) |e Sonstige |4 oth | |
| 856 | 4 | 0 | |u http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=592583 |x Aggregator |3 Volltext |
| 912 | |a ZDB-4-EBA | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-028530479 | ||
| 966 | e | |u http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=592583 |l FAW01 |p ZDB-4-EBA |q FAW_PDA_EBA |x Aggregator |3 Volltext | |
| 966 | e | |u http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=592583 |l FAW02 |p ZDB-4-EBA |q FAW_PDA_EBA |x Aggregator |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804175521338097664 |
|---|---|
| any_adam_object | |
| author | Hwang, Frank |
| author_facet | Hwang, Frank |
| author_role | aut |
| author_sort | Hwang, Frank |
| author_variant | f h fh |
| building | Verbundindex |
| bvnumber | BV043106288 |
| collection | ZDB-4-EBA |
| ctrlnum | (OCoLC)844311189 (DE-599)BVBBV043106288 |
| dewey-full | 512.73 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 512 - Algebra |
| dewey-raw | 512.73 |
| dewey-search | 512.73 |
| dewey-sort | 3512.73 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>05353nmm a2200481zcb4500</leader><controlfield tag="001">BV043106288</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">151126s2013 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9789814412346</subfield><subfield code="9">978-981-4412-34-6</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9789814412353</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">978-981-4412-35-3</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">981441235X</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">981-4412-35-X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)844311189</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043106288</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-1046</subfield><subfield code="a">DE-1047</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">512.73</subfield><subfield code="2">22</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Hwang, Frank</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Partitions, Vol. II, Multi-parameter</subfield><subfield code="b">optimality and clustering</subfield><subfield code="c">Frank K Hwang, Uriel G Rothblum, Hong-Bin Chen</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Singapore</subfield><subfield code="b">World Scientific Pub. Co.</subfield><subfield code="c">c2013</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (x, 291 p.)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Series on applied mathematics</subfield><subfield code="v">v. 20</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references (p. 283-288) and index</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">1. Bounded-shape sum-partition problems: polyhedral approach. 1.1. Linear objective: solution by LP. 1.2. Enumerating vertices of the partition polytopes and corresponding partitions using edge-directions. 1.3. Representation, characterization and enumeration of vertices of partition polytopes: distinct partitioned vectors. 1.4. Representation, characterization and enumeration of vertices of partition polytopes: general case. 2. Constrained-shape and single-size sum-partition problems: polynomial approach. 2.1. Constrained-shape partition polytopes and (almost-) separable partitions. 2.2. Enumerating separable and limit-separable partitions of constrained-shape. 2.3. Single-size partition polytopes and cone-separable partitions. 2.4. Enumerating (limit-) cone-separable partitions -- </subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a"> - 3. Partitions over multi-parameter spaces: combinatorial structure. 3.1. Properties of partitions. 3.2. Counting and enumerating partition classes of single-size. 3.3. Consistency and sortability of particular partition-properties -- 4. Clustering problems over multi-parameter spaces. 4.1. Geometric properties of optimal partitions. 4.2. Geometric properties of optimal partitions for d = 2 -- 5. Sum-multipartition problems over single-parameter spaces. 5.1. Multipartitions. 5.2. Single-multishape multipartition polytopes. 5.3. Constrained-multishape multipartition polytopes. 5.4. Combinatorial properties of multipartitions. 5.5. Constrained-multishape multipartition problems with asymmetric Schur convex objective: optimization over multipartition polytopes. 5.6. Sum multipartition problems: explicit solutions -- </subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a"> - 6. Applications. 6.1. Assembly of systems. 6.2. Group testing. 6.3. Circuit card library. 6.4. Clustering. 6.5. Abstraction of finite state machines. 6.6. Multischeduling. 6.7. Cache assignment. 6.8. The blood analyzer problem. 6.9. Joint replenishment of inventory. 6.10. Statistical hypothesis testing. 6.11. Nearest neighbor assignment. 6.12. Graph partitions. 6.13. The traveling salesman problem. 6.14. Vehicle routing. 6.15. Division of property. 6.16. The consolidation of farmland</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">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</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS / Number Theory</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Partitions (Mathematics)</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Partitions (Mathematics)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Rothblum, Uriel G.</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Chen, Hong-Bin</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="710" ind1="2" ind2=" "><subfield code="a">World Scientific (Firm)</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=592583</subfield><subfield code="x">Aggregator</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-EBA</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-028530479</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=592583</subfield><subfield code="l">FAW01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FAW_PDA_EBA</subfield><subfield code="x">Aggregator</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=592583</subfield><subfield code="l">FAW02</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FAW_PDA_EBA</subfield><subfield code="x">Aggregator</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV043106288 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T07:17:36Z |
| institution | BVB |
| isbn | 9789814412346 9789814412353 981441235X |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-028530479 |
| oclc_num | 844311189 |
| open_access_boolean | |
| owner | DE-1046 DE-1047 |
| owner_facet | DE-1046 DE-1047 |
| physical | 1 Online-Ressource (x, 291 p.) |
| psigel | ZDB-4-EBA ZDB-4-EBA FAW_PDA_EBA |
| publishDate | 2013 |
| publishDateSearch | 2013 |
| publishDateSort | 2013 |
| publisher | World Scientific Pub. Co. |
| record_format | marc |
| series2 | Series on applied mathematics |
| spelling | Hwang, Frank Verfasser aut Partitions, Vol. II, Multi-parameter optimality and clustering Frank K Hwang, Uriel G Rothblum, Hong-Bin Chen Singapore World Scientific Pub. Co. c2013 1 Online-Ressource (x, 291 p.) txt rdacontent c rdamedia cr rdacarrier Series on applied mathematics v. 20 Includes bibliographical references (p. 283-288) and index 1. Bounded-shape sum-partition problems: polyhedral approach. 1.1. Linear objective: solution by LP. 1.2. Enumerating vertices of the partition polytopes and corresponding partitions using edge-directions. 1.3. Representation, characterization and enumeration of vertices of partition polytopes: distinct partitioned vectors. 1.4. Representation, characterization and enumeration of vertices of partition polytopes: general case. 2. Constrained-shape and single-size sum-partition problems: polynomial approach. 2.1. Constrained-shape partition polytopes and (almost-) separable partitions. 2.2. Enumerating separable and limit-separable partitions of constrained-shape. 2.3. Single-size partition polytopes and cone-separable partitions. 2.4. Enumerating (limit-) cone-separable partitions -- - 3. Partitions over multi-parameter spaces: combinatorial structure. 3.1. Properties of partitions. 3.2. Counting and enumerating partition classes of single-size. 3.3. Consistency and sortability of particular partition-properties -- 4. Clustering problems over multi-parameter spaces. 4.1. Geometric properties of optimal partitions. 4.2. Geometric properties of optimal partitions for d = 2 -- 5. Sum-multipartition problems over single-parameter spaces. 5.1. Multipartitions. 5.2. Single-multishape multipartition polytopes. 5.3. Constrained-multishape multipartition polytopes. 5.4. Combinatorial properties of multipartitions. 5.5. Constrained-multishape multipartition problems with asymmetric Schur convex objective: optimization over multipartition polytopes. 5.6. Sum multipartition problems: explicit solutions -- - 6. Applications. 6.1. Assembly of systems. 6.2. Group testing. 6.3. Circuit card library. 6.4. Clustering. 6.5. Abstraction of finite state machines. 6.6. Multischeduling. 6.7. Cache assignment. 6.8. The blood analyzer problem. 6.9. Joint replenishment of inventory. 6.10. Statistical hypothesis testing. 6.11. Nearest neighbor assignment. 6.12. Graph partitions. 6.13. The traveling salesman problem. 6.14. Vehicle routing. 6.15. Division of property. 6.16. The consolidation of farmland 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 MATHEMATICS / Number Theory bisacsh Partitions (Mathematics) fast Partitions (Mathematics) Rothblum, Uriel G. Sonstige oth Chen, Hong-Bin Sonstige oth World Scientific (Firm) Sonstige oth http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=592583 Aggregator Volltext |
| spellingShingle | Hwang, Frank Partitions, Vol. II, Multi-parameter optimality and clustering MATHEMATICS / Number Theory bisacsh Partitions (Mathematics) fast Partitions (Mathematics) |
| title | Partitions, Vol. II, Multi-parameter optimality and clustering |
| title_auth | Partitions, Vol. II, Multi-parameter optimality and clustering |
| title_exact_search | Partitions, Vol. II, Multi-parameter optimality and clustering |
| title_full | Partitions, Vol. II, Multi-parameter optimality and clustering Frank K Hwang, Uriel G Rothblum, Hong-Bin Chen |
| title_fullStr | Partitions, Vol. II, Multi-parameter optimality and clustering Frank K Hwang, Uriel G Rothblum, Hong-Bin Chen |
| title_full_unstemmed | Partitions, Vol. II, Multi-parameter optimality and clustering Frank K Hwang, Uriel G Rothblum, Hong-Bin Chen |
| title_short | Partitions, Vol. II, Multi-parameter |
| title_sort | partitions vol ii multi parameter optimality and clustering |
| title_sub | optimality and clustering |
| topic | MATHEMATICS / Number Theory bisacsh Partitions (Mathematics) fast Partitions (Mathematics) |
| topic_facet | MATHEMATICS / Number Theory Partitions (Mathematics) |
| url | http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=592583 |
| work_keys_str_mv | AT hwangfrank partitionsvoliimultiparameteroptimalityandclustering AT rothblumurielg partitionsvoliimultiparameteroptimalityandclustering AT chenhongbin partitionsvoliimultiparameteroptimalityandclustering AT worldscientificfirm partitionsvoliimultiparameteroptimalityandclustering |