Knapsack Problems (HC, 2004)

bookgate
(12)
PrivatAngemeldet als privater Verkäufer
Verbraucherschützende Vorschriften, die sich aus dem EU-Verbraucherrecht ergeben, finden daher keine Anwendung. Der eBay-Käuferschutz gilt dennoch für die meisten Käufe.
Mehr Artikel des Verkäufers
Verkäufer kontaktieren
US $230,00
Ca.CHF 183,13
oder Preisvorschlag
Artikelzustand:
Neuwertig
“Hard cover and all pages in perfect condition. This is a library version with some stamps on the ”... Mehr erfahrenÜber den Artikelzustand
Ganz entspannt. Rückgaben akzeptiert.
Versand:
US $25,00 (ca. CHF 19,91) Standard Shipping from outside US.
Standort: Hornbæk, Dänemark
Aufgrund von US-Zollbestimmungen muss der Käufer dieses Artikels vor der Lieferung Einfuhrgebühren an den Versanddienstleister entrichten. Mehr erfahren
Einfuhrgebühren:
Vor der Lieferung fällige Einfuhrgebühren
Lieferung:
Lieferung zwischen Fr, 28. Nov und Do, 11. Dez nach 94104 bei heutigem Zahlungseingang
Liefertermine - wird in neuem Fenster oder Tab geöffnet berücksichtigen die Bearbeitungszeit des Verkäufers, die PLZ des Artikelstandorts und des Zielorts sowie den Annahmezeitpunkt und sind abhängig vom gewählten Versandservice und dem ZahlungseingangZahlungseingang - wird ein neuem Fenster oder Tab geöffnet. Insbesondere während saisonaler Spitzenzeiten können die Lieferzeiten abweichen.
Rücknahme:
14 Tage Rückgabe. Käufer zahlt Rückversand. Wenn Sie ein eBay-Versandetikett verwenden, werden die Kosten dafür von Ihrer Rückerstattung abgezogen.
Zahlungen:
     Diners Club

Sicher einkaufen

eBay-Käuferschutz
Geld zurück, wenn etwas mit diesem Artikel nicht stimmt. Mehr erfahreneBay-Käuferschutz - wird in neuem Fenster oder Tab geöffnet
Der Verkäufer ist für dieses Angebot verantwortlich.
eBay-Artikelnr.:374349379078
Zuletzt aktualisiert am 11. Nov. 2025 13:43:57 MEZAlle Änderungen ansehenAlle Änderungen ansehen

Artikelmerkmale

Artikelzustand
Neuwertig
Buch, das wie neu aussieht, aber bereits gelesen wurde. Der Einband weist keine sichtbaren Gebrauchsspuren auf. Bei gebundenen Büchern ist der Schutzumschlag vorhanden (sofern zutreffend). Alle Seiten sind vollständig vorhanden, es gibt keine zerknitterten oder eingerissenen Seiten und im Text oder im Randbereich wurden keine Unterstreichungen, Markierungen oder Notizen vorgenommen. Der Inneneinband kann minimale Gebrauchsspuren aufweisen. Minimale Gebrauchsspuren. Genauere Einzelheiten sowie eine Beschreibung eventueller Mängel entnehmen Sie bitte dem Angebot des Verkäufers. Alle Zustandsdefinitionen ansehenwird in neuem Fenster oder Tab geöffnet
Hinweise des Verkäufers
“Hard cover and all pages in perfect condition. This is a library version with some stamps on the ...
Country of Origin
Germany
Educational Level
Adult & Further Education
Features
Ex-Library
Level
Advanced
ISBN
9783540402862
Kategorie

Über dieses Produkt

Product Identifiers

Publisher
Springer Berlin / Heidelberg
ISBN-10
3540402861
ISBN-13
9783540402862
eBay Product ID (ePID)
6058641

Product Key Features

Number of Pages
Xx, 548 Pages
Publication Name
Knapsack Problems
Language
English
Publication Year
2003
Subject
Machine Theory, Operations Research, Computer Science, Optimization
Type
Textbook
Author
David Pisinger, Hans Kellerer, Ulrich Pferschy
Subject Area
Mathematics, Computers, Business & Economics
Format
Hardcover

Dimensions

Item Weight
75.8 Oz
Item Length
9.2 in
Item Width
6.1 in

Additional Product Features

Intended Audience
Scholarly & Professional
LCCN
2004-299674
Reviews
From the reviews: "The book explores the knapsack problem and its variants in 15 chapters ... . On the whole, the authors present a rich amount of material, much of which belongs to the most recent advancement in the subject ... . This self-contained monograph is a valuable addition to the existing literature on knapsack problems. It will certainly make an excellent reference for researchers in combinatorial optimization. ... In this regard, the libraries in this field-should have a copy of this book on their shelves." (J Xue, Journal of the Operational Research Society, Vol. 56 (11), 2005) "This book provides a comprehensive overview of the methods for solving KP, its variants and generalizations. ... By presenting a range of algorithmic techniques, this book is also a suitable tool for studying modern algorithms. ... With its more than 500 references and its author and subject indexes, this book will be a valuable tool for many researchers in combinatorial optimization." (Peter Butkovic, Mathematical Reviews, 2006 d) "This book presents a large number of new results for knapsack problems, especially related to exact and approximate (heuristic) algorithms. Moreover, many modifications and extensions of the knapsack problem are treated. To do this, the authors found and consequently used a close connection between manifold contents and a clear, stimulating presentation. ... With an introduction into NP-completeness of knapsack problems a monograph ends, which spans the range from a comprehensive introduction to the most recent and advanced results very nicely." (Jürgen Köhler, OR Spectrum, Issue 27, 2005) "The book starts with a basic introduction to the knapsack problem ... . It proceeds with a discussion about the basic techniques available for the solution to this problem, which makes it useful reading for undergraduate students of computer science, mathematics and economics. ... In conclusion, it could be said that the book is a valuable source for students, but also for researchers interested in this problem." (K. Soric, Zentralblatt MATH, Vol. 1103 (5), 2007), From the reviews: "The book explores the knapsack problem and its variants in 15 chapters ... . On the whole, the authors present a rich amount of material, much of which belongs to the most recent advancement in the subject ... . This self-contained monograph is a valuable addition to the existing literature on knapsack problems. It will certainly make an excellent reference for researchers in combinatorial optimization. ... In this regard, the libraries in this field-should have a copy of this book on their shelves." (J Xue, Journal of the Operational Research Society, Vol. 56 (11), 2005) "This book provides a comprehensive overview of the methods for solving KP, its variants and generalizations. ... By presenting a range of algorithmic techniques, this book is also a suitable tool for studying modern algorithms. ... With its more than 500 references and its author and subject indexes, this book will be a valuable tool for many researchers in combinatorial optimization." (Peter Butkovic, Mathematical Reviews, 2006 d) "This book presents a large number of new results for knapsack problems, especially related to exact and approximate (heuristic) algorithms. Moreover, many modifications and extensions of the knapsack problem are treated. To do this, the authors found and consequently used a close connection between manifold contents and a clear, stimulating presentation. ... With an introduction into NP-completeness of knapsack problems a monograph ends, which spans the range from a comprehensive introduction to the most recent and advanced results very nicely." (Jrgen Khler, OR Spectrum, Issue 27, 2005) "The book starts with a basic introduction to the knapsack problem ... . It proceeds with a discussion about the basic techniques available for the solution to this problem, which makes it useful reading for undergraduate students of computer science, mathematics and economics. ... In conclusion, it could be said that the book is a valuable source for students, but also for researchers interested in this problem." (K. Soric, Zentralblatt MATH, Vol. 1103 (5), 2007), From the reviews: "The book explores the knapsack problem and its variants in 15 chapters a? . On the whole, the authors present a rich amount of material, much of which belongs to the most recent advancement in the subject a? . This self-contained monograph is a valuable addition to the existing literature on knapsack problems. It will certainly make an excellent reference for researchers in combinatorial optimization. a? In this regard, the libraries in this field-should have a copy of this book on their shelves." (J Xue, Journal of the Operational Research Society, Vol. 56 (11), 2005) "This book provides a comprehensive overview of the methods for solving KP, its variants and generalizations. a? By presenting a range of algorithmic techniques, this book is also a suitable tool for studying modern algorithms. a? With its more than 500 references and its author and subject indexes, this book will be a valuable tool for many researchers in combinatorial optimization." (Peter Butkovic, Mathematical Reviews, 2006 d) "This book presents a large number of new results for knapsack problems, especially related to exact and approximate (heuristic) algorithms. Moreover, many modifications and extensions of the knapsack problem are treated. To do this, the authors found and consequently used a close connection between manifold contents and a clear, stimulating presentation. a? With an introduction into NP-completeness of knapsack problems a monograph ends, which spans the range from a comprehensive introduction to the most recent and advanced results very nicely." (J'rgen K'hler, OR Spectrum, Issue 27, 2005), From the reviews:"The book explores the knapsack problem and its variants in 15 chapters … . On the whole, the authors present a rich amount of material, much of which belongs to the most recent advancement in the subject … . This self-contained monograph is a valuable addition to the existing literature on knapsack problems. It will certainly make an excellent reference for researchers in combinatorial optimization. … In this regard, the libraries in this field-should have a copy of this book on their shelves." (J Xue, Journal of the Operational Research Society, Vol. 56 (11), 2005)"This book provides a comprehensive overview of the methods for solving KP, its variants and generalizations. … By presenting a range of algorithmic techniques, this book is also a suitable tool for studying modern algorithms. … With its more than 500 references and its author and subject indexes, this book will be a valuable tool for many researchers in combinatorial optimization." (Peter Butkovic, Mathematical Reviews, 2006 d)"This book presents a large number of new results for knapsack problems, especially related to exact and approximate (heuristic) algorithms. Moreover, many modifications and extensions of the knapsack problem are treated. To do this, the authors found and consequently used a close connection between manifold contents and a clear, stimulating presentation. … With an introduction into NP-completeness of knapsack problems a monograph ends, which spans the range from a comprehensive introduction to the most recent and advanced results very nicely." (Jürgen Köhler, OR Spectrum, Issue 27, 2005)"The book starts with a basic introduction to the knapsack problem … . It proceeds with a discussion about the basic techniques available for the solution to this problem, which makes it useful reading for undergraduate students of computer science, mathematics and economics. … In conclusion, it could be said that the book is a valuable source for students, but also for researchers interested in this problem." (K. Å oric, Zentralblatt MATH, Vol. 1103 (5), 2007), From the reviews: "The book explores the knapsack problem and its variants in 15 chapters ... . On the whole, the authors present a rich amount of material, much of which belongs to the most recent advancement in the subject ... . This self-contained monograph is a valuable addition to the existing literature on knapsack problems. It will certainly make an excellent reference for researchers in combinatorial optimization. ... In this regard, the libraries in this field-should have a copy of this book on their shelves." (J Xue, Journal of the Operational Research Society, Vol. 56 (11), 2005) "This book provides a comprehensive overview of the methods for solving KP, its variants and generalizations. ... By presenting a range of algorithmic techniques, this book is also a suitable tool for studying modern algorithms. ... With its more than 500 references and its author and subject indexes, this book will be a valuable tool for many researchers in combinatorial optimization." (Peter Butkovic, Mathematical Reviews, 2006 d) "This book presents a large number of new results for knapsack problems, especially related to exact and approximate (heuristic) algorithms. Moreover, many modifications and extensions of the knapsack problem are treated. To do this, the authors found and consequently used a close connection between manifold contents and a clear, stimulating presentation. ... With an introduction into NP-completeness of knapsack problems a monograph ends, which spans the range from a comprehensive introduction to the most recent and advanced results very nicely." (Jürgen Köhler, OR Spectrum, Issue 27, 2005) "The book starts with a basic introduction to the knapsack problem ... . It proceeds with a discussion about the basic techniques available for the solution to this problem, which makes it useful reading for undergraduate students of computer science, mathematics and economics. ... In conclusion, it could be said thatthe book is a valuable source for students, but also for researchers interested in this problem." (K. Soric, Zentralblatt MATH, Vol. 1103 (5), 2007), From the reviews: "The book explores the knapsack problem and its variants in 15 chapters … . On the whole, the authors present a rich amount of material, much of which belongs to the most recent advancement in the subject … . This self-contained monograph is a valuable addition to the existing literature on knapsack problems. It will certainly make an excellent reference for researchers in combinatorial optimization. … In this regard, the libraries in this field-should have a copy of this book on their shelves." (J Xue, Journal of the Operational Research Society, Vol. 56 (11), 2005) "This book provides a comprehensive overview of the methods for solving KP, its variants and generalizations. … By presenting a range of algorithmic techniques, this book is also a suitable tool for studying modern algorithms. … With its more than 500 references and its author and subject indexes, this book will be a valuable tool for many researchers in combinatorial optimization." (Peter Butkovic, Mathematical Reviews, 2006 d) "This book presents a large number of new results for knapsack problems, especially related to exact and approximate (heuristic) algorithms. Moreover, many modifications and extensions of the knapsack problem are treated. To do this, the authors found and consequently used a close connection between manifold contents and a clear, stimulating presentation. … With an introduction into NP-completeness of knapsack problems a monograph ends, which spans the range from a comprehensive introduction to the most recent and advanced results very nicely." (Jürgen Köhler, OR Spectrum, Issue 27, 2005) "The book starts with a basic introduction to the knapsack problem … . It proceeds with a discussion about the basic techniques available for the solution to this problem, which makes it useful reading for undergraduate students of computer science, mathematics and economics. … In conclusion, it could be said that the book is a valuable source for students, but also for researchers interested in this problem." (K. Å oric, Zentralblatt MATH, Vol. 1103 (5), 2007)
Dewey Edition
22
Number of Volumes
1 vol.
Illustrated
Yes
Dewey Decimal
519.6
Synopsis
Thirteen years have passed since the seminal book on knapsack problems by Martello and Toth appeared. On this occasion a former colleague exclaimed back in 1990: "How can you write 250 pages on the knapsack problem?" Indeed, the definition of the knapsack problem is easily understood even by a non-expert who will not suspect the presence of challenging research topics in this area at the first glance. However, in the last decade a large number of research publications contributed new results for the knapsack problem in all areas of interest such as exact algorithms, heuristics and approximation schemes. Moreover, the extension of the knapsack problem to higher dimensions both in the number of constraints and in the num­ ber of knapsacks, as well as the modification of the problem structure concerning the available item set and the objective function, leads to a number of interesting variations of practical relevance which were the subject of intensive research during the last few years. Hence, two years ago the idea arose to produce a new monograph covering not only the most recent developments of the standard knapsack problem, but also giving a comprehensive treatment of the whole knapsack family including the siblings such as the subset sum problem and the bounded and unbounded knapsack problem, and also more distant relatives such as multidimensional, multiple, multiple-choice and quadratic knapsack problems in dedicated chapters., Thirteen years have passed since the seminal book on knapsack problems by Martello and Toth appeared. On this occasion a former colleague exclaimed back in 1990: "How can you write 250 pages on the knapsack problem?" Indeed, the definition of the knapsack problem is easily understood even by a non-expert who will not suspect the presence of challenging research topics in this area at the first glance. However, in the last decade a large number of research publications contributed new results for the knapsack problem in all areas of interest such as exact algorithms, heuristics and approximation schemes. Moreover, the extension of the knapsack problem to higher dimensions both in the number of constraints and in the num- ber of knapsacks, as well as the modification of the problem structure concerning the available item set and the objective function, leads to a number of interesting variations of practical relevance which were the subject of intensive research during the last few years. Hence, two years ago the idea arose to produce a new monograph covering not only the most recent developments of the standard knapsack problem, but also giving a comprehensive treatment of the whole knapsack family including the siblings such as the subset sum problem and the bounded and unbounded knapsack problem, and also more distant relatives such as multidimensional, multiple, multiple-choice and quadratic knapsack problems in dedicated chapters.
LC Classification Number
QA402.5-402.6

Artikelbeschreibung des Verkäufers

Info zu diesem Verkäufer

bookgate

100% positive Bewertungen•29 Artikel verkauft

Mitglied seit Okt 2022
Antwortet meist innerhalb 24 Stunden
Angemeldet als privater VerkäuferDaher finden verbraucherschützende Vorschriften, die sich aus dem EU-Verbraucherrecht ergeben, keine Anwendung. Der eBay-Käuferschutz gilt dennoch für die meisten Käufe.
Mehr Artikel des VerkäufersKontakt

Verkäuferbewertungen (13)

Alle Bewertungenselected
Positiv
Neutral
Negativ
  • k***o (54)- Bewertung vom Käufer.
    Letzte 6 Monate
    Bestätigter Kauf
    Fast shipping, item as described, meticulous packaging. Excellent service, thank you!
    Network Flows (HC 1993) (Nr. 374298734350)
  • a***m (0)- Bewertung vom Käufer.
    Letztes Jahr
    Bestätigter Kauf
    Everything went great, very well packaged! The book is absolutely like new, as mentioned. Good quality and trustworthy
    Algorithms in C, Parts 1-4: Fundamentals, Data Structures, ... (Nr. 375633855991)
  • _***2 (145)- Bewertung vom Käufer.
    Letztes Jahr
    Bestätigter Kauf
    GOOD SELLER. THANKS!
    Antwort von bookgate- Verkäufer bookgate hat auf Bewertung reagiert.- Verkäufer bookgate hat auf Bewertung reagiert.
    Prompt payment, perfect transaction!
    Manifolds, Tensor Analysis, and Applications (Nr. 374716469808)
Alle Bewertungen ansehen