Integer optimization by local search : a domain-independent approach
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 Searc...
Enregistré dans:
| Auteur principal: | |
|---|---|
| Autres auteurs: | |
| Format: | Livre numérique |
| Langue: | Anglais |
| Publié: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Collection: | Lecture notes in computer science. Lecture notes in artificial intelligence
1637 |
| Sujets: | |
| Accès en ligne: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Note: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Integer optimization by local search, a domain-independent approach, Joachim Paul Walser, 1999, New York, Springer, 1 vol. (XV-137 p.), Lecture notes in computer science, 3-540-66367-3 • Integer Optimization by Local Search, Texte imprimé, 9783662185766 |
Table des matières:
- Frameworks for Combinatorial Optimization
- Local Search for Integer Constraints
- Case Studies Methodology
- Time-Tabling and Sports Scheduling
- Covering and Assignment
- Capacitated Production Planning
- Extensions.