Vendeur
Books From California, Simi Valley, CA, Etats-Unis
Évaluation du vendeur 4 sur 5 étoiles
Vendeur AbeBooks depuis 14 août 2001
N° de réf. du vendeur mon0003865158
Well-written, popular textbook on combinatorial optimization
One of very few textbooks on this topic
Subject area has manifold applications
Offers complete but concise proofs, making it an invaluable practical tool for students
Updated fifth edition
À propos de l'auteur:
Bernhard Korte is professor of operations research and director of the Research Institute for Discrete Mathematics at the University of Bonn. He founded the Arithmeum in Bonn and received numerous awards, including a honorary doctoral degree and the "Staatspreis NRW". His research interests include combinatorial optimization and chip design.
Jens Vygen is professor of discrete mathematics at the University of Bonn and principal investigator of the Hausdorff Center for Mathematics. He also co-authored the textbook "Algorithmic Mathematics" and has served as editor of several books and journals. His research interests include combinatorial optimization and algorithms for chip design.
Titre : Combinatorial Optimization: Theory and ...
Éditeur : Springer
Date d'édition : 2018
Reliure : hardcover
Etat : Very Good
Vendeur : medimops, Berlin, Allemagne
Etat : very good. Gut/Very good: Buch bzw. Schutzumschlag mit wenigen Gebrauchsspuren an Einband, Schutzumschlag oder Seiten. / Describes a book or dust jacket that does show some signs of wear on either the binding, dust jacket or pages. N° de réf. du vendeur M03662560380-V
Quantité disponible : 1 disponible(s)
Vendeur : Marlton Books, Bridgeton, NJ, Etats-Unis
Etat : Acceptable. Readable, but has significant damage / tears. Has a remainder mark. hardcover Used - Acceptable 2018. N° de réf. du vendeur AB-012859
Quantité disponible : 1 disponible(s)
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Etat : As New. Unread book in perfect condition. N° de réf. du vendeur 30500279
Quantité disponible : 1 disponible(s)
Vendeur : Brook Bookstore On Demand, Napoli, NA, Italie
Etat : new. Questo è un articolo print on demand. N° de réf. du vendeur 26b8fd3066d2dcf49b0683def8e33710
Quantité disponible : Plus de 20 disponibles
Vendeur : moluna, Greven, Allemagne
Gebunden. Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Well-written, popular textbook on combinatorial optimization One of very few textbooks on this topic Subject area has manifold applications Offers complete but concise proofs, making it an invaluable practical tool for students . N° de réf. du vendeur 178843969
Quantité disponible : Plus de 20 disponibles
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Etat : New. N° de réf. du vendeur 30500279-n
Quantité disponible : 1 disponible(s)
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
Etat : New. N° de réf. du vendeur 30500279-n
Quantité disponible : Plus de 20 disponibles
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Etat : New. In English. N° de réf. du vendeur ria9783662560389_new
Quantité disponible : Plus de 20 disponibles
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Buch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -Well-written, popular textbook on combinatorial optimizationOne of very few textbooks on this topicSubject area has manifold applicationsOffers complete but concise proofs, making it an invaluable practical tool for studentsUpdated fifth editionSpringer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 720 pp. Englisch. N° de réf. du vendeur 9783662560389
Quantité disponible : 1 disponible(s)
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Etat : good. May show signs of wear, highlighting, writing, and previous use. This item may be a former library book with typical markings. No guarantee on products that contain supplements Your satisfaction is 100% guaranteed. Twenty-five year bookseller with shipments to over fifty million happy customers. N° de réf. du vendeur 30500279-5
Quantité disponible : 1 disponible(s)