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 |
| Θέματα: | |
| Διαθέσιμο Online: | 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 |
Πίνακας περιεχομένων:
- 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.