Computational combinatorial optimization : optimal or provably near-optimal solutions
This tutorial contains written versions of seven lectures on Computational Combinatorial Optimization given by leading members of the optimization community. The lectures introduce modern combinatorial optimization techniques, with an emphasis on branch and cut algorithms and Lagrangian relaxation a...
সংরক্ষণ করুন:
| প্রধান লেখক: | |
|---|---|
| অন্যান্য লেখক: | |
| বিন্যাস: | Livre numérique |
| ভাষা: | Anglais |
| প্রকাশিত: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| মালা: | Lecture notes in computer science
2241 |
| বিষয়গুলি: | |
| অনলাইন ব্যবহার করুন: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| টীকা: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Computational combinatorial optimization, optimal or provably near-optimal solutions, Michael Juÿger, Denis Naddef (eds.), Berlin, Springer, 2001, 1 vol. (VII-303 p.), Lecture notes in computer science, 3-540-42877-1 • Computational Combinatorial Optimization, Texte imprimé, 9783662206980 |
| সংক্ষিপ্ত: | This tutorial contains written versions of seven lectures on Computational Combinatorial Optimization given by leading members of the optimization community. The lectures introduce modern combinatorial optimization techniques, with an emphasis on branch and cut algorithms and Lagrangian relaxation approaches. Polyhedral combinatorics as the mathematical backbone of successful algorithms are covered from many perspectives, in particular, polyhedral projection and lifting techniques and the importance of modeling are extensively discussed. Applications to prominent combinatorial optimization problems, e.g., in production and transport planning, are treated in many places; in particular, the book contains a state-of-the-art account of the most successful techniques for solving the traveling salesman problem to optimality. |
|---|---|
| উপাদানের বিবরণ: | Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| আইসবিএন: | 9783540455868 (PDF) |
| আইএসএসএন: | 1611-3349 |
| প্রবেশাধিকার: | Accès en ligne pour les établissements français bénéficiaires des licences nationales Accès soumis à abonnement pour tout autre établissement Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 |