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...
Guardado en:
| Autor principal: | |
|---|---|
| Otros Autores: | |
| Formato: | Livre numérique |
| Lenguaje: | Anglais |
| Publicado: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Colección: | Lecture notes in computer science
2241 |
| Materias: | |
| Acceso en línea: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
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 |
| LEADER | 03763nam a22004457a 4500 | ||
|---|---|---|---|
| 001 | 969365 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155172352 | ||
| 020 | |a 9783540455868 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 004 | ||
| 082 | |a 519.7 | ||
| 100 | 1 | |a Junger, Michael. | |
| 245 | 1 | 0 | |a Computational combinatorial optimization : |b optimal or provably near-optimal solutions |c [edited by] Michael Jünger, Denis Naddef. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 2241 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a General Mixed Integer Programming: Computational Issues for Branch-and-Cut Algorithms -- Projection and Lifting in Combinatorial Optimization -- Mathematical Programming Models and Formulations for Deterministic Production Planning Problems -- Lagrangian Relaxation -- Branch-and-Cut Algorithms for Combinatorial Optimization and Their Implementation in ABACUS -- Branch, Cut, and Price: Sequential and Parallel -- TSP Cuts Which Do Not Conform to the Template Paradigm. | |
| 506 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | ||
| 506 | |a Accès soumis à abonnement pour tout autre établissement | ||
| 506 | |a 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 | ||
| 520 | |a 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. | ||
| 650 | |a Informatique | ||
| 650 | |a Optimisation combinatoire | ||
| 650 | |a Algorithmes | ||
| 650 | |a Analyse numérique | ||
| 650 | |a Programmation (mathématiques) | ||
| 650 | |a Analyse combinatoire | ||
| 650 | |a Structures de données (informatique) | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Naddef, Denis, |d 19..-...., |c auteur en mathématiques appliquées. |4 pbd | |
| 776 | 0 | |0 05941734X |t Computational combinatorial optimization |o optimal or provably near-optimal solutions |f Michael Juÿger, Denis Naddef (eds.) |c Berlin |n Springer |d 2001 |p 1 vol. (VII-303 p.) |s Lecture notes in computer science |z 3-540-42877-1 | |
| 776 | 0 | |t Computational Combinatorial Optimization |b Texte imprimé |z 9783662206980 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/3-540-45586-8 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-7GV4X1QH-7 |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:750674814 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-45586-8 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:754023311 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-45586-8 |z Accès INSA CVL | |
| 997 | |0 969365 |1 Livre numérique |a Ressource numérique |b INSA |b ENSA |c 0/Bibliothèque numérique/ |c 1/Bibliothèque numérique/Autre ressource numérique/ | ||