| 书目名称 | Integer Optimization by Local Search |
| 副标题 | A Domain-Independent |
| 编辑 | Joachim Paul Walser |
| 视频video | |
| 概述 | Includes supplementary material: |
| 丛书名称 | Lecture Notes in Computer Science |
| 图书封面 |  |
| 描述 | Integer Optimization addresses a wide spectrum of practically important optimization problems and represents a major challenge for algorithmics. The goal of integer optimization is to solve a system of constraints and optimization criteria over discrete variables..Integer Optimization by Local Search. introduces a new approach to domain-independent integer optimization, which, unlike traditional strategies, is based on local search. It develops the central concepts and strategies of integer local search and describes possible combinations with classical methods from linear programming. The surprising effectiveness of the approach is demonstrated in a variety of case studies on large-scale, realistic problems, including production planning, timetabling, radar surveillance, and sports scheduling. The monograph is written for practitioners and researchers from artificial intelligence and operations research. |
| 出版日期 | Book 1999 |
| 关键词 | Extension; Local Search; Planning; Variable; algorithmics; algorithms; artificial intelligence; combinatori |
| 版次 | 1 |
| doi | https://doi.org/10.1007/3-540-48369-1 |
| isbn_softcover | 978-3-540-66367-6 |
| isbn_ebook | 978-3-540-48369-4Series ISSN 0302-9743 Series E-ISSN 1611-3349 |
| issn_series | 0302-9743 |
| copyright | Springer-Verlag Berlin Heidelberg 1999 |
发表于 2025-3-21 18:20:54
