Cargando…
Heuristics : theory and applications /
| Clasificación: | Libro Electrónico |
|---|---|
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
New York :
Nova Publishers,
[2013]
|
| Colección: | Mathematics research developments
Engineering tools, techniques and tables |
| Temas: | |
| Acceso en línea: | Texto completo |
MARC
| LEADER | 00000cam a2200000 i 4500 | ||
|---|---|---|---|
| 001 | EBSCO_ocn839304999 | ||
| 003 | OCoLC | ||
| 005 | 20231017213018.0 | ||
| 006 | m o d | ||
| 007 | cr ||||||||||| | ||
| 008 | 130308t20132013nyua ob 001 0 eng | ||
| 010 | |a 2020679622 | ||
| 040 | |a DLC |b eng |e rda |c DLC |d YDXCP |d E7B |d OCLCF |d EBLCP |d AGLDB |d VTS |d AU@ |d STF |d M8D |d N$T |d OCLCO |d OCL |d OCLCQ |d OCLCO | ||
| 020 | |a 9781624176647 |q (ebook) | ||
| 020 | |a 162417664X | ||
| 020 | |z 1624176372 |q (hardcover) | ||
| 020 | |z 9781624176371 |q (hardcover) | ||
| 029 | 1 | |a AU@ |b 000062325843 | |
| 029 | 1 | |a DEBSZ |b 429950276 | |
| 029 | 1 | |a DEBBG |b BV043070039 | |
| 029 | 1 | |a DEBBG |b BV041637061 | |
| 029 | 1 | |a CHNEW |b 000604792 | |
| 035 | |a (OCoLC)839304999 | ||
| 050 | 0 | 0 | |a QA76.9.A43 |
| 072 | 7 | |a COM |x 051390 |2 bisacsh | |
| 072 | 7 | |a COM |x 051230 |2 bisacsh | |
| 072 | 7 | |a COM |x 051440 |2 bisacsh | |
| 082 | 0 | 0 | |a 005.1 |2 23 |
| 049 | |a UAMI | ||
| 245 | 0 | 0 | |a Heuristics : |b theory and applications / |c Patrick Siarry, editor. |
| 264 | 1 | |a New York : |b Nova Publishers, |c [2013] | |
| 300 | |a 1 online resource. | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 490 | 0 | |a Mathematics research developments | |
| 490 | 0 | |a Engineering tools, techniques and tables | |
| 504 | |a Includes bibliographical references and index. | ||
| 588 | |a Description based on print version record. | ||
| 505 | 0 | |a HEURISTICS ; HEURISTICS ; CONTENTS ; PREFACE ; CONTINUOUS-GRASP REVISITED; Abstract; 1.Introduction; 1.1.Unconstrained global optimization and metaheuristics; 1.2.Coupling Metaheuristics with Direct Searches; 1.3.Motivations and Directions of Our Proposals; 2.From GRASP to C-GRASP; 2.1.C-GRASP: Versions 2006 and 2010; 2.2. Construction Procedure; 2.3.Local Improvement Procedure; 2.4.Summary of Parameters and Speci cities; 3.Revisiting C-GRASP: the Version 2012; 3.1.Construction Procedure with Linear Complexity; 3.2.Local Improvement by Direct Search; 3.3.Control of Discretization. | |
| 505 | 8 | |a 4.Numerical Experiments4.1.Protocols and Benchmarks; 4.2.ConvergenceAnalysisandValidationofthePropositions; 4.3.Precision Within Limited Evaluation Budget; 4.4.Strengths and Weaknesses; Conclusion; A Detailed Experimental Results; A1.Convergence Results; A2.Precision Within Limited Evaluation Budget; B Benchmark Functions; References; THE NOISING METHODS ; ABSTRACT ; 1. INTRODUCTION ; 2. PRINCIPLES OF THE NOISING METHODS ; 2.1. Choice of the Elementary Transformation ; 2.2. How to Scan the Neighbourhood ; 2.3. How to Add a Noise. | |
| 505 | 8 | |a 2.4. The Probability Distribution of the Noise and Links with Some Other Metaheuristics 2.5. Parameters of the Noising Methods ; 2.6. Automatic Tuning of the Parameters ; 2.7. Variants ; 3. APPLICATIONS OF THE NOISING METHODS; 3.1. Graph Partitioning ; 3.2. Linear Ordering Problem ; 3.3. Travelling Salesman Problem ; CONCLUSION ; APPENDIX ; REFERENCES ; MATHEURISTICS: EMBEDDING MILP SOLVERS INTO HEURISTIC ALGORITHMS FOR COMBINATORIAL OPTIMIZATION PROBLEMS; Abstract; 1.Introduction; 2.Local Branching; 2.1.A Local Branching Procedure for Network Design; 3.VariablesPartitioningLocalSearch(VPLS) | |
| 505 | 8 | |a 3.1.AVPLS Procedure for the Two-Machine Total Completion Time Flow Shop Problem3.2.AVPLS Approach for Nurse Rostering; 4.Continous Relaxation Based (CRB)Matheuristics; 4.1.Feasibility Pump for General MILPs; 4.2.ACRB Matheuristic Procedure for the Closest String Problem; 4.3.A CRB Matheuristic Procedure for the Multi-dimensional Knapsack; 5.GreedyBasedMatheuristics; 5.1.A Greedy Based Matheuristic Procedure for the Eternity II Problem; Conclusion; References. | |
| 505 | 8 | |a AN EMPIRICAL INVESTIGATION OF DIFFERENT SOLUTION STRATEGIES FOR META-HEURISTIC OPTIMIZATION: SOLUTION REPRESENTATION, DIVERSITY AND SPACE REDUCTION Abstract; 1.Introduction; 2.Characteristicsofthesolutionsearchprocess; 2.1.Solution representation; 2.2.Solution Diversity; 2.3.Solution Space Reduction; 3.TwoExampleCaseStudies; 3.1.Resource-constrained Project Scheduling; 3.1.1.Solution Representation; 3.1.2.Solution Diversity; 3.1.3.Space Reduction; 3.1.4.Experimental Results for Project Scheduling; 3.2.Personnel Scheduling; 3.2.1.Solution Representation; 3.2.2.Solution Diversity. | |
| 590 | |a eBooks on EBSCOhost |b EBSCO eBook Subscription Academic Collection - Worldwide | ||
| 650 | 0 | |a Heuristic algorithms. | |
| 650 | 0 | |a Computer algorithms. | |
| 650 | 0 | |a Algorithms. | |
| 650 | 6 | |a Algorithmes heuristiques. | |
| 650 | 6 | |a Algorithmes. | |
| 650 | 7 | |a algorithms. |2 aat | |
| 650 | 7 | |a COMPUTERS |x Programming |x Open Source. |2 bisacsh | |
| 650 | 7 | |a COMPUTERS |x Software Development & Engineering |x General. |2 bisacsh | |
| 650 | 7 | |a COMPUTERS |x Software Development & Engineering |x Tools. |2 bisacsh | |
| 650 | 7 | |a Algorithms |2 fast | |
| 650 | 7 | |a Computer algorithms |2 fast | |
| 650 | 7 | |a Heuristic algorithms |2 fast | |
| 700 | 1 | |a Siarry, Patrick, |e editor of compilation. | |
| 776 | 0 | 8 | |i Print version: |t Heuristics |d New York : Nova Publishers, [2013] |z 9781624176371 (hardcover) |w (DLC) 2012048213 |
| 856 | 4 | 0 | |u https://ebsco.uam.elogim.com/login.aspx?direct=true&scope=site&db=nlebk&AN=564185 |z Texto completo |
| 938 | |a YBP Library Services |b YANK |n 10438632 | ||
| 938 | |a EBSCOhost |b EBSC |n 564185 | ||
| 938 | |a ebrary |b EBRY |n ebr10704293 | ||
| 938 | |a ProQuest Ebook Central |b EBLB |n EBL3022325 | ||
| 994 | |a 92 |b IZTAP | ||