Cliquer sur une vignette pour aller sur Google Books.
Chargement... Computational combinatorial optimization : optimal or provably near-optimal solutionspar M. Jünger
Aucun Chargement...
Inscrivez-vous à LibraryThing pour découvrir si vous aimerez ce livre Actuellement, il n'y a pas de discussions au sujet de ce livre. Aucune critique aucune critique | ajouter une critique
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. Aucune description trouvée dans une bibliothèque |
Discussion en coursAucun
Google Books — Chargement... GenresClassification décimale de Melvil (CDD)519.7Natural sciences and mathematics Mathematics Applied Mathematics, Probabilities Linear And Nonlinear ProgrammingClassification de la Bibliothèque du CongrèsÉvaluationMoyenne: Pas d'évaluation.Est-ce vous ?Devenez un(e) auteur LibraryThing. |