Bild 1 von 1
Rucksackprobleme, Hardcover von Kellerer, Hans; Pferschy, Ulrich; Pisinger, D...-
Artikelzustand:
3 verfügbar
Preis:
US $305,28
Ca.EUR 281,60
- Sofort-KaufenRucksackprobleme, Hardcover von Kellerer, Hans; Pferschy, Ulrich; Pisinger, D...
Versand:
Standort: Jessup, Maryland, USA
Lieferung:
Lieferung zwischen Sa, 15. Jun und Do, 27. Jun nach 43230 bei heutigem Zahlungseingang
Rücknahmen:
Zahlungen:
Sicher einkaufen
Angaben zum Verkäufer
- 96,8% positive Bewertungen
Angemeldet als gewerblicher Verkäufer
Der Verkäufer ist für dieses Angebot verantwortlich.
eBay-Artikelnr.:386963369097
Artikelmerkmale
- Artikelzustand
- Book Title
- Knapsack Problems
- ISBN
- 9783540402862
- Publication Year
- 2003
- Type
- Textbook
- Format
- Hardcover
- Language
- English
- Publication Name
- Knapsack Problems
- Item Length
- 9.2in
- Publisher
- Springer Berlin / Heidelberg
- Item Width
- 6.1in
- Item Weight
- 75.8 Oz
- Number of Pages
- Xx, 548 Pages
Über dieses Produkt
Product Information
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.
Product Identifiers
Publisher
Springer Berlin / Heidelberg
ISBN-10
3540402861
ISBN-13
9783540402862
eBay Product ID (ePID)
6058641
Product Key Features
Publication Name
Knapsack Problems
Format
Hardcover
Language
English
Publication Year
2003
Type
Textbook
Number of Pages
Xx, 548 Pages
Dimensions
Item Length
9.2in
Item Width
6.1in
Item Weight
75.8 Oz
Additional Product Features
Number of Volumes
1 Vol.
Lc Classification Number
Qa402.5-402.6
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 … . 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 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 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)
Copyright Date
2004
Topic
Machine Theory, Computer Science, Operations Research, Optimization
Lccn
2004-299674
Dewey Decimal
519.6
Intended Audience
Scholarly & Professional
Dewey Edition
22
Illustrated
Yes
Genre
Computers, Business & Economics, Mathematics
Artikelbeschreibung des Verkäufers
Rechtliche Informationen des Verkäufers
Expert Trading Limited
John Boyer
9220 Rumsey Rd
Ste 101
21045-1956 Columbia, MD
United States
Ich versichere, dass alle meine Verkaufsaktivitäten in Übereinstimmung mit allen geltenden Gesetzen und Vorschriften der EU erfolgen.
Der Verkäufer ist für dieses Angebot verantwortlich.
eBay-Artikelnr.:386963369097
Verpackung und Versand
Artikelstandort:
Jessup, Maryland, USA
Versand nach:
Afghanistan, Albanien, Algerien, Amerika, Andorra, Anguilla, Antigua und Barbuda, Argentinien, Armenien, Aruba, Aserbaidschan, Australien, Bahamas, Bahrain, Bangladesch, Belgien, Belize, Benin, Bermuda, Bhutan, Bolivien, Bosnien und Herzegowina, Brunei Darussalam, Bulgarien, Burkina Faso, Burundi, Chile, China, Costa Rica, Côte d'Ivoire (Elfenbeinküste), Demokratische Republik Kongo, Deutschland, Dominikanische Republik, Dschibuti, Dänemark, Ecuador, El Salvador, Eritrea, Estland, Europa, Fidschi, Finnland, Gabun, Gambia, Georgien, Ghana, Gibraltar, Grenada, Griechenland, Grönland, Guatemala, Guinea, Guinea-Bissau, Guyana, Haiti, Honduras, Hongkong, Indien, Indonesien, Irland, Island, Israel, Italien, Jamaika, Japan, Jordanien, Kaimaninseln, Kambodscha, Kamerun, Kanada, Kapverdische Inseln, Kasachstan, Katar, Kenia, Kirgisistan, Kiribati, Kolumbien, Kuwait, Lettland, Libanon, Liberia, Liechtenstein, Litauen, Luxemburg, Macau, Madagaskar, Malawi, Malaysia, Malediven, Mali, Malta, Marokko, Mauretanien, Mexiko, Moldawien, Monaco, Mongolei, Montenegro, Montserrat, Mosambik, Namibia, Nauru, Nepal, Neuseeland, Nicaragua, Niederlande, Niger, Norwegen, Oman, Pakistan, Panama, Papua-Neuguinea, Paraguay, Peru, Philippinen, Polen, Portugal, Republik Kongo, Republik Kroatien, Ruanda, Rumänien, Salomonen, Sambia, Samoa (Westsamoa), San Marino, Schweden, Schweiz, Senegal, Serbien, Sierra Leone, Simbabwe, Singapur, Slowakei, Slowenien, Spanien, Sri Lanka, St. Kitts und Nevis, St. Lucia, St. Vincent und die Grenadinen, Suriname, Südafrika, Südkorea, Taiwan, Tansania, Thailand, Togo, Tonga, Trinidad und Tobago, Tschechische Republik, Tunesien, Turks- und Caicosinseln, Uganda, Ungarn, Usbekistan, Vanuatu, Vatikan, Vereinigte Arabische Emirate, Vereinigtes Königreich, Vietnam, Wallis und Futuna, Zentralafrikanische Republik, Zypern, Ägypten, Äquatorialguinea, Äthiopien, Österreich
Ausgeschlossen:
APO/FPO, Angola, Barbados, Botsuana, Brasilien, Frankreich, Französisch-Guayana, Französisch-Polynesien, Guadeloupe, Jemen, Laos, Lesotho, Libyen, Martinique, Mauritius, Mazedonien, Neukaledonien, Nigeria, Russische Föderation, Réunion, Saint-Pierre und Miquelon, Saudi-Arabien, Seychellen, Swasiland, Tadschikistan, Tschad, Turkmenistan, Türkei, US-Protektorate, Ukraine, Uruguay, Venezuela
| Verpackung und Versand | Jeder zusätzliche Artikel | Nach | Service | Lieferung*Siehe Lieferhinweise |
|---|---|---|---|---|
| Kostenloser Versand | Kostenlos | USA | Economy Shipping | Lieferung zwischen Sa, 15. Jun und Do, 27. Jun nach 43230 |
| Bearbeitungszeit |
|---|
| Der Verkäufer verschickt den Artikel innerhalb von 10 Werktagen nach Zahlungseingang. |
| Steuern |
|---|
| Verkäufer berechnet Steuern in |
Mehrwertsteuer für diesen Artikel #386963369097
Mehrwertsteuer für diesen Artikel #386963369097
Der Verkäufer berechnet Mehrwertsteuer für Artikel, die in die folgenden Bundesstaaten verschickt werden:
| Bundesstaat | Steuersatz für Sales Tax |
|---|
Rücknahmebedingungen
| Frist für Kontaktaufnahme mit dem Verkäufer nach Erhalt Artikels: | Rückerstattung erfolgt in folgender Form: | Rücksendung |
|---|---|---|
| 14 Tage | Geld zurück | Käufer zahlt Rückversand |
Der Käufer trägt die Rücksendekosten.
| Rücknahmebedingungen im Detail |
|---|
| Rücknahme akzeptiert |
Zahlungsdaten
Zahlungsmethoden
Angemeldet als gewerblicher Verkäufer
Verkäuferbewertungen (342.512)
c***i (27)- Bewertung vom Käufer.
Letzter Monat
Bestätigter Kauf
I thought I'd ordered the wrong book and immediately (within an hour or so) and asked the order be cancelled. It was not which surprised me. Still, I found the book does have value.
g***7 (94)- Bewertung vom Käufer.
Letzter Monat
Bestätigter Kauf
Good seller and will buy again
e***e (370)- Bewertung vom Käufer.
Letzter Monat
Bestätigter Kauf
lots of good info
Noch mehr entdecken:
- Hans-Christian-Andersen-Belletristik - Bücher,
- Hans-Christian-Andersen Hörbücher,
- Hans-Christian-Andersen Hörbücher und Hörspiele,
- Hans-Christian-Andersen-Sachbuch Bücher,
- Hans-Christian-Andersen-Märchen - Belletristik-Bücher,
- Hans-Christian-Andersen Hörbücher und Hörspiele auf Englisch,
- Hans-Christian-Andersen-Belletristik - Jugendliche Bücher,
- Hans-Christian-Andersen-Märchen - Belletristik-Bücher auf Deutsch,
- Hans-Christian-Andersen-Märchen - Belletristik-Jugendliche Bücher,
- Hans-Christian-Andersen-Bilder - Belletristik-Bücher auf Deutsch