Articles liés à Computational Combinatorial Optimization: Optimal or...
Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions - Couverture souple
Synopsis
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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Acheter neuf
Afficher cet article
EUR 48,37
EUR 9,70 expédition depuis Allemagne vers France
Destinations, frais et délaisRésultats de recherche pour Computational Combinatorial Optimization: Optimal or...
Image d'archives
Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions (Lecture Notes in Computer Science)
Edité par
Springer, 2001
ISBN 10 : 3540428771
ISBN 13 : 9783540428770
Ancien ou d'occasion
Paperback
Vendeur : Books From California, Simi Valley, CA, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : Good. Ex- library book with stamps/ stickers. N° de réf. du vendeur mon0003288752
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Computational Combinatorial Optimization
Edité par
Springer Berlin Heidelberg, 2001
ISBN 10 : 3540428771
ISBN 13 : 9783540428770
Neuf
Couverture souple
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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. N° de réf. du vendeur 4890120
Quantité disponible : Plus de 20 disponibles
Image d'archives
Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions (Lecture Notes in Computer Science, 2241)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In. N° de réf. du vendeur ria9783540428770_new
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Computational Combinatorial Optimization : Optimal or Provably Near-Optimal Solutions
Edité par
Springer Berlin Heidelberg, 2001
ISBN 10 : 3540428771
ISBN 13 : 9783540428770
Neuf
Taschenbuch
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. N° de réf. du vendeur 9783540428770
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Computational Combinatorial Optimization
Edité par
Springer Berlin Heidelberg Nov 2001, 2001
ISBN 10 : 3540428771
ISBN 13 : 9783540428770
Neuf
Taschenbuch
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 320 pp. Englisch. N° de réf. du vendeur 9783540428770
Quantité disponible : 2 disponible(s)
Image d'archives
Computational Combinatorial Optimization : Optimal or Provably Near-Optimal Solutions
Vendeur : Chiron Media, Wallingford, Royaume-Uni
Évaluation du vendeur 4 sur 5 étoiles
PF. Etat : New. N° de réf. du vendeur 6666-IUK-9783540428770
Quantité disponible : 10 disponible(s)
Image fournie par le vendeur
Computational Combinatorial Optimization
Edité par
Springer Berlin Heidelberg, Springer Berlin Heidelberg Nov 2001, 2001
ISBN 10 : 3540428771
ISBN 13 : 9783540428770
Neuf
Taschenbuch
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 320 pp. Englisch. N° de réf. du vendeur 9783540428770
Quantité disponible : 2 disponible(s)
Image fournie par le vendeur
Computational Combinatorial Optimization : Optimal or Provably Near-Optimal Solutions
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur 916264-n
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Computational Combinatorial Optimization : Optimal or Provably Near-Optimal Solutions
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur 916264-n
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Computational Combinatorial Optimization : Optimal or Provably Near-Optimal Solutions
Edité par
Springer, 2001
ISBN 10 : 3540428771
ISBN 13 : 9783540428770
Ancien ou d'occasion
Couverture souple
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : As New. Unread book in perfect condition. N° de réf. du vendeur 916264
Quantité disponible : Plus de 20 disponibles