Combinatorial theory / Martin Aigner |
Autore | Aigner, Martin |
Edizione | [Reprint of the 1979 ed] |
Pubbl/distr/stampa | Berlino : Springer-Verlag, copyr. 1997 |
Descrizione fisica | VIII,483 p. : ill. ; 23 cm |
Disciplina | 511.64 |
Soggetto non controllato | analisi combinatoria |
ISBN | 3-540-61787-6 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNISA-990000247200203316 |
Aigner, Martin | ||
Berlino : Springer-Verlag, copyr. 1997 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Combinatorics : proceedings of the Eighth British Combinatorial Conference, University College, Swansea, 1981 / edited by H. N. V. Temperley |
Autore | British Combinatorial Conference <8. ; 1981 ; Swansea> |
Pubbl/distr/stampa | Cambridge [Cambridgeshire] : Cambridge University Press, 1981 |
Descrizione fisica | 189 p. : ill. ; 23 cm |
Disciplina | 511.64 |
Altri autori (Persone) | Temperley, H. N. V. |
Collana | London Mathematical Society lecture note series, 0076-0552 ; 52 |
Soggetto topico |
Combinatorial analysis
Combinatorial analysis - Congresses |
ISBN | 0521285143 |
Classificazione |
AMS 05-06
AMS 05-XX QA164 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNISALENTO-991000759219707536 |
British Combinatorial Conference <8. ; 1981 ; Swansea> | ||
Cambridge [Cambridgeshire] : Cambridge University Press, 1981 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. del Salento | ||
|
Combinatorics of permutations / Miklòs Bòna |
Autore | BONA, Miklòs |
Pubbl/distr/stampa | Boca Raton [etc.] : Chapman & Hall/CRC, copyr. 2004 |
Descrizione fisica | 383 p. : ill. ; 24 cm |
Disciplina | 511.64 |
Collana | Discrete mathematics and its applications |
Soggetto topico |
Analisi combinatoria
Matematica |
ISBN | 1-58488-434-7 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNISA-990003115100203316 |
BONA, Miklòs | ||
Boca Raton [etc.] : Chapman & Hall/CRC, copyr. 2004 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Combinatorics of permutations / Miklós Bóna |
Autore | Bóna, Miklós |
Pubbl/distr/stampa | Boca Raton : Chapman & Hall/CRC, c2004 |
Descrizione fisica | 383 p. : ill. ; 25 cm |
Disciplina | 511.64 |
Collana | Discrete mathematics and its applications |
Soggetto topico | Permutations |
ISBN | 1584884347 |
Classificazione |
AMS 05A05
AMS 05-01 AMS 05A15 LC QA165.B66 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNISALENTO-991002737189707536 |
Bóna, Miklós | ||
Boca Raton : Chapman & Hall/CRC, c2004 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. del Salento | ||
|
Handbook of discrete and combinatorial mathematics / editor-in-chief Kenneth H. Rosen...[et al.] |
Pubbl/distr/stampa | Boca Raton : CRC Press, copyr. 2000 |
Descrizione fisica | 1232 p. : ill. ; 25 cm |
Disciplina | 511.64 |
Soggetto non controllato |
analisi combinatoria
matematica |
ISBN | 0-8493-0149-1 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNISA-990000254270203316 |
Boca Raton : CRC Press, copyr. 2000 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Intelligent algorithms for packing and cutting problem / / Yunqing Rao, Qiang Luo |
Autore | Rao Yunqing |
Pubbl/distr/stampa | Gateway East, Singapore : , : Springer, , [2022] |
Descrizione fisica | 1 online resource (338 pages) |
Disciplina | 511.64 |
Collana | Engineering applications of computational methods |
Soggetto topico |
Cutting stock problem
Cybernetics Cibernètica |
Soggetto genere / forma | Llibres electrònics |
ISBN | 981-19-5916-1 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto |
Intro -- Preface -- Contents -- 1 Introduction to the Packing and Cutting Problem -- 1.1 Problem Definition -- 1.1.1 Packing Problem -- 1.1.2 Cutting Problem -- 1.2 Literature Review -- 1.2.1 Review for 2DRSP -- 1.2.2 Review for 2DISP -- 1.2.3 Review for CSP -- 1.3 Development Trends -- References -- 2 Intelligent Algorithms for Rectangular Packing Problem -- 2.1 Problem Description -- 2.2 Memetic Algorithm for the Problem -- 2.2.1 Introduction -- 2.2.2 The Placement Strategy -- 2.2.3 The Memetic Algorithm -- 2.2.4 Implementation of Memetic Algorithm -- 2.2.5 Experimental Results -- 2.3 Discrete Grey Wolf Optimization -- 2.3.1 Introduction -- 2.3.2 Improved Best-Fit Heuristic Algorithm -- 2.3.3 Discrete Grey Wolf Optimization -- 2.3.4 Experimentation and Results -- 2.4 Conclusions -- References -- 3 Intelligent Algorithms for Irregular Packing Problem -- 3.1 Problem Description -- 3.2 The Geometrical Technique -- 3.3 Memetic Algorithm for the Problem -- 3.3.1 Introduction -- 3.3.2 The Memetic Algorithm -- 3.3.3 The Realization of the Adaptive Memetic Algorithm -- 3.3.4 Experimental Study and Discussions -- 3.4 Beam Search Hybridized with Tabu Search for the Problem -- 3.4.1 Introduction -- 3.4.2 Placement Principle Based on Improved NFP -- 3.4.3 The Hybrid Algorithm for Searching Sequence -- 3.4.4 Experimental Results and Discussions -- 3.5 Biased Genetic Algorithm Hybridized with VNS for the Problem -- 3.5.1 Introduction -- 3.5.2 Placement Method -- 3.5.3 Biased Genetic Algorithm Hybridized with VNS -- 3.5.4 Experimental Results and Discussions -- 3.6 Conclusions -- Appendix -- References -- 4 Novel Algorithms for 2DRSP and 2DISP -- 4.1 Reinforcement Learning Algorithm for 2DRPP -- 4.1.1 Introduction and Problem Description -- 4.1.2 Lowest Centroid Placement Method -- 4.1.3 Sequence Optimization Based on Q-learning.
4.1.4 Computational Packing Experiments -- 4.2 Reinforcement Learning Algorithm for 2DIPP -- 4.2.1 Introduction -- 4.2.2 Description of Packing Problem -- 4.2.3 Positioning Strategy Based on BL -- 4.2.4 Sequence Optimization Strategy -- 4.2.5 Computational Experiment -- 4.3 Sequential Transfer-Based PSO for 2DIPP -- 4.3.1 Introduction -- 4.3.2 Novel Positioning Strategy Based on NFP -- 4.3.3 Description of Sequence Transfer -- 4.3.4 Computational Experiments -- References -- 5 Solutions for New Variants of Packing Problem -- 5.1 Knapsack Packing Problem with Defects -- 5.1.1 Introduction and Literature Review -- 5.1.2 Problem Description -- 5.1.3 The Approach for the Problem -- 5.1.4 Numerical Experiments and Conclusions -- 5.2 Irregular Packing Problem with Defects -- 5.2.1 Introduction and Problem Description -- 5.2.2 Literature Review -- 5.2.3 Genetic Algorithm and Grey Wolf Optimization -- 5.2.4 Heuristic Placement Algorithm -- 5.2.5 Computational Results and Conclusions -- 5.3 Rectangular Packing Problem with Divisible Items -- 5.3.1 Introduction and Problem Description -- 5.3.2 Related Work -- 5.3.3 The Heuristic Placement Method -- 5.3.4 Integration with Metaheuristic -- 5.3.5 Numerical Experiments and Conclusions -- Appendix -- References -- 6 Integration of Packing and Cutting -- 6.1 An Integrated Approach on Packing and Cut Planning -- 6.1.1 Introduction -- 6.1.2 The Three-Stage Solution -- 6.1.3 Mathematical Modeling -- 6.1.4 The Solving Approach -- 6.1.5 Computational Experiments and Discussion -- 6.2 An Integrated System for Packing and Cutting-Punching -- 6.2.1 Introduction -- 6.2.2 The Overall Structure -- 6.2.3 The Data Structure of IKBS -- 6.2.4 The Knowledge Base of IKBS -- 6.2.5 Case Study and Discussion -- 6.3 An Integrated System for Packing and Sheet Metal Cutting -- 6.3.1 Introduction -- 6.3.2 The System Overall Structure. 6.3.3 Nest Planning -- 6.3.4 CAD/CAPP/CAM -- 6.3.5 Case Study -- References -- 7 Intelligent Algorithms for Cutting Scheduling Problem -- 7.1 Problem Description -- 7.2 Improved Hierarchical Genetic Algorithm for the CSP -- 7.2.1 Introduction -- 7.2.2 Problem Statement and Mathematical Modeling -- 7.2.3 Ant Colony-Hierarchical Genetic Algorithm -- 7.2.4 Computational Experiments -- 7.2.5 Conclusions -- 7.3 Hybrid Genetic Algorithm for the Bi-Objective CSP -- 7.3.1 Introduction -- 7.3.2 Problem Description and Formulation -- 7.3.3 VNSGA III Based on Reference Points -- 7.3.4 Evaluation Metric -- 7.3.5 Experimental Design and Results -- 7.4 GWO Algorithm for the Bi-Objective CSP -- 7.4.1 Introduction -- 7.4.2 Problem Description and Formulation -- 7.4.3 Reference-Point-Based GWO Algorithm -- 7.4.4 Experimental Design and Results -- References -- 8 Application on Laser Cutting of Metal Sheets -- 8.1 Introduction to LaserCAM Software -- 8.1.1 Graphics Module -- 8.1.2 Packing Module -- 8.1.3 Laser Cutting Module -- 8.1.4 NC and Report Module -- 8.2 Case 1: Rectangular Packing and Cutting -- 8.3 Case 2: Irregular Packing and Cutting. |
Record Nr. | UNINA-9910616369203321 |
Rao Yunqing | ||
Gateway East, Singapore : , : Springer, , [2022] | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Intelligent algorithms for packing and cutting problem / / Yunqing Rao, Qiang Luo |
Autore | Rao Yunqing |
Pubbl/distr/stampa | Gateway East, Singapore : , : Springer, , [2022] |
Descrizione fisica | 1 online resource (338 pages) |
Disciplina | 511.64 |
Collana | Engineering applications of computational methods |
Soggetto topico |
Cutting stock problem
Cybernetics Cibernètica |
Soggetto genere / forma | Llibres electrònics |
ISBN | 981-19-5916-1 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto |
Intro -- Preface -- Contents -- 1 Introduction to the Packing and Cutting Problem -- 1.1 Problem Definition -- 1.1.1 Packing Problem -- 1.1.2 Cutting Problem -- 1.2 Literature Review -- 1.2.1 Review for 2DRSP -- 1.2.2 Review for 2DISP -- 1.2.3 Review for CSP -- 1.3 Development Trends -- References -- 2 Intelligent Algorithms for Rectangular Packing Problem -- 2.1 Problem Description -- 2.2 Memetic Algorithm for the Problem -- 2.2.1 Introduction -- 2.2.2 The Placement Strategy -- 2.2.3 The Memetic Algorithm -- 2.2.4 Implementation of Memetic Algorithm -- 2.2.5 Experimental Results -- 2.3 Discrete Grey Wolf Optimization -- 2.3.1 Introduction -- 2.3.2 Improved Best-Fit Heuristic Algorithm -- 2.3.3 Discrete Grey Wolf Optimization -- 2.3.4 Experimentation and Results -- 2.4 Conclusions -- References -- 3 Intelligent Algorithms for Irregular Packing Problem -- 3.1 Problem Description -- 3.2 The Geometrical Technique -- 3.3 Memetic Algorithm for the Problem -- 3.3.1 Introduction -- 3.3.2 The Memetic Algorithm -- 3.3.3 The Realization of the Adaptive Memetic Algorithm -- 3.3.4 Experimental Study and Discussions -- 3.4 Beam Search Hybridized with Tabu Search for the Problem -- 3.4.1 Introduction -- 3.4.2 Placement Principle Based on Improved NFP -- 3.4.3 The Hybrid Algorithm for Searching Sequence -- 3.4.4 Experimental Results and Discussions -- 3.5 Biased Genetic Algorithm Hybridized with VNS for the Problem -- 3.5.1 Introduction -- 3.5.2 Placement Method -- 3.5.3 Biased Genetic Algorithm Hybridized with VNS -- 3.5.4 Experimental Results and Discussions -- 3.6 Conclusions -- Appendix -- References -- 4 Novel Algorithms for 2DRSP and 2DISP -- 4.1 Reinforcement Learning Algorithm for 2DRPP -- 4.1.1 Introduction and Problem Description -- 4.1.2 Lowest Centroid Placement Method -- 4.1.3 Sequence Optimization Based on Q-learning.
4.1.4 Computational Packing Experiments -- 4.2 Reinforcement Learning Algorithm for 2DIPP -- 4.2.1 Introduction -- 4.2.2 Description of Packing Problem -- 4.2.3 Positioning Strategy Based on BL -- 4.2.4 Sequence Optimization Strategy -- 4.2.5 Computational Experiment -- 4.3 Sequential Transfer-Based PSO for 2DIPP -- 4.3.1 Introduction -- 4.3.2 Novel Positioning Strategy Based on NFP -- 4.3.3 Description of Sequence Transfer -- 4.3.4 Computational Experiments -- References -- 5 Solutions for New Variants of Packing Problem -- 5.1 Knapsack Packing Problem with Defects -- 5.1.1 Introduction and Literature Review -- 5.1.2 Problem Description -- 5.1.3 The Approach for the Problem -- 5.1.4 Numerical Experiments and Conclusions -- 5.2 Irregular Packing Problem with Defects -- 5.2.1 Introduction and Problem Description -- 5.2.2 Literature Review -- 5.2.3 Genetic Algorithm and Grey Wolf Optimization -- 5.2.4 Heuristic Placement Algorithm -- 5.2.5 Computational Results and Conclusions -- 5.3 Rectangular Packing Problem with Divisible Items -- 5.3.1 Introduction and Problem Description -- 5.3.2 Related Work -- 5.3.3 The Heuristic Placement Method -- 5.3.4 Integration with Metaheuristic -- 5.3.5 Numerical Experiments and Conclusions -- Appendix -- References -- 6 Integration of Packing and Cutting -- 6.1 An Integrated Approach on Packing and Cut Planning -- 6.1.1 Introduction -- 6.1.2 The Three-Stage Solution -- 6.1.3 Mathematical Modeling -- 6.1.4 The Solving Approach -- 6.1.5 Computational Experiments and Discussion -- 6.2 An Integrated System for Packing and Cutting-Punching -- 6.2.1 Introduction -- 6.2.2 The Overall Structure -- 6.2.3 The Data Structure of IKBS -- 6.2.4 The Knowledge Base of IKBS -- 6.2.5 Case Study and Discussion -- 6.3 An Integrated System for Packing and Sheet Metal Cutting -- 6.3.1 Introduction -- 6.3.2 The System Overall Structure. 6.3.3 Nest Planning -- 6.3.4 CAD/CAPP/CAM -- 6.3.5 Case Study -- References -- 7 Intelligent Algorithms for Cutting Scheduling Problem -- 7.1 Problem Description -- 7.2 Improved Hierarchical Genetic Algorithm for the CSP -- 7.2.1 Introduction -- 7.2.2 Problem Statement and Mathematical Modeling -- 7.2.3 Ant Colony-Hierarchical Genetic Algorithm -- 7.2.4 Computational Experiments -- 7.2.5 Conclusions -- 7.3 Hybrid Genetic Algorithm for the Bi-Objective CSP -- 7.3.1 Introduction -- 7.3.2 Problem Description and Formulation -- 7.3.3 VNSGA III Based on Reference Points -- 7.3.4 Evaluation Metric -- 7.3.5 Experimental Design and Results -- 7.4 GWO Algorithm for the Bi-Objective CSP -- 7.4.1 Introduction -- 7.4.2 Problem Description and Formulation -- 7.4.3 Reference-Point-Based GWO Algorithm -- 7.4.4 Experimental Design and Results -- References -- 8 Application on Laser Cutting of Metal Sheets -- 8.1 Introduction to LaserCAM Software -- 8.1.1 Graphics Module -- 8.1.2 Packing Module -- 8.1.3 Laser Cutting Module -- 8.1.4 NC and Report Module -- 8.2 Case 1: Rectangular Packing and Cutting -- 8.3 Case 2: Irregular Packing and Cutting. |
Record Nr. | UNISA-996495171003316 |
Rao Yunqing | ||
Gateway East, Singapore : , : Springer, , [2022] | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Magic Squares : Their History and Construction from Ancient Times to AD 1600 / / by Jacques Sesiano |
Autore | Sesiano Jacques |
Edizione | [1st ed. 2019.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
Descrizione fisica | 1 online resource (321 pages) |
Disciplina | 511.64 |
Collana | Sources and Studies in the History of Mathematics and Physical Sciences |
Soggetto topico |
Mathematics
History History of Mathematical Sciences |
ISBN | 3-030-17993-1 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | I. Introduction -- II. Ordinary magic squares -- A. Squares of odd orders -- B. Squares of evenly-even orders -- C. Squares of evenly-odd orders -- III. Composite magic squares -- A. Equal subshares displaying different sums -- B. Equal subshares displaying equal sums -- C. Division into unequal parts -- IV. Bordered magic squares -- A. Squares of odd orders -- B. Squares of evenly-even orders -- C. Squares of evenly-odd orders -- V. Bordered squares with separation by parity -- 1. The main square and its parts -- 2. Filling the inner square -- 3. Filling the remainder of the square by trial and error -- A. Methodical filling of the oblique square -- B. Methodical placing of the even numbers -- C. Particular case of the order 5 -- VI. Magic squares with non-consecutive numbers -- A. Squares of odd orders -- B. Squares of evenly-even orders -- C. Squares of evenly-odd orders -- VII. 1. Literal squares -- 2. Squares with one empty cell -- 3. Squares with divided cells -- 4. Magic triangles -- 5. Magic crosses -- 6. Magic circles -- 7. Magic rectangles -- 8. Magic cubes -- Appendices -- Bibliography -- Index. |
Record Nr. | UNINA-9910338257203321 |
Sesiano Jacques | ||
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Magic Squares in the Tenth Century : Two Arabic Treatises by Anṭākī and Būzjānī / / by Jacques Sesiano |
Autore | Sesiano Jacques |
Edizione | [1st ed. 2017.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
Descrizione fisica | 1 online resource (VIII, 396 p. 267 illus.) |
Disciplina | 511.64 |
Collana | Sources and Studies in the History of Mathematics and Physical Sciences |
Soggetto topico |
Mathematics
History History of Mathematical Sciences |
ISBN | 3-319-52114-4 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Part I. Tenth-century construction methods -- Introduction -- I. Ordinary Magic Squares -- II. Bordered Magic Squares -- III. Separation by Parity -- IV. Composite Magic Squares -- Part II. Translation -- Editorial Procedure -- Text A -- Text B -- Opuscule on the Magic Square by al-Kharaqī -- Part III. Arabic Texts -- Editorial Procedure -- Text A -- Text B -- Opuscule on the Magic Square by al-Kharaqī -- Bibliography -- Index. |
Record Nr. | UNINA-9910254309303321 |
Sesiano Jacques | ||
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Magic tricks, card shuffling, and dynamic computer memories / S. Brent Morris |
Autore | Morris, S. Brent |
Pubbl/distr/stampa | [Washington, D.C.] : Mathematical Association of America, c1998 |
Descrizione fisica | xviii, 148 p. : ill. ; 23 cm. |
Disciplina | 511.64 |
Collana | Spectrum series |
Soggetto topico | Matematica - Principi generali |
ISBN | 0883855275 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNISALENTO-991001812519707536 |
Morris, S. Brent | ||
[Washington, D.C.] : Mathematical Association of America, c1998 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. del Salento | ||
|