第 1/3 張圖片
圖片庫
第 1/3 張圖片
有類似物品要出售？
Knapsack Problems (HC, 2004)
US $230.00
大約HK$ 1,789.31
或講價
狀況：
“Hard cover and all pages in perfect condition. This is a library version with some stamps on the ”... 閱讀更多內容關於物品狀況
很新
狀況完好的書籍。封面發亮且沒有損壞，精裝本書籍含書皮。不存在缺頁或內頁受損，無褶皺或破損，同時也沒有對文字標注/標記，或在留白處書寫內容。內封面上標記極少。書籍的磨損和破損程度也很低。
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
運送：
US $25.00（大約 HK$ 194.49） Standard Shipping from outside US.
所在地：Hornbæk, 丹麥
送達日期：
估計於 10月7日 (星期二)至 10月24日 (星期五)之間送達 運送地點 94104
退貨：
14 日退貨. 由買家支付退貨運費，如果你使用 eBay 郵寄標籤，相關費用將從你的退款金額中扣除.
保障：
請參閱物品說明或聯絡賣家以取得詳細資料。閱覽全部詳情查看保障詳情
（不符合「eBay 買家保障方案」資格）
物品細節
- 物品狀況
- 很新
- 賣家備註
- Educational Level
- Adult & Further Education
- Features
- Ex-Library
- Level
- Advanced
- Country/Region of Manufacture
- Germany
- ISBN
- 9783540402862
關於產品
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
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
賣家提供的物品說明
賣家信用評價 （13）
- k***o (52)- 買家留下的信用評價。過去 6 個月購買已獲認證Fast shipping, item as described, meticulous packaging. Excellent service, thank you!
- a***m (0)- 買家留下的信用評價。過去 1 年購買已獲認證Everything went great, very well packaged! The book is absolutely like new, as mentioned. Good quality and trustworthyAlgorithms in C, Parts 1-4: Fundamentals, Data Structures, ...（#375633855991）
- _***2 (140)- 買家留下的信用評價。過去 1 年購買已獲認證GOOD SELLER. THANKS!bookgate 的回覆- 賣家 bookgate 回應的信用評價- 賣家 bookgate 回應的信用評價Prompt payment, perfect transaction!Manifolds, Tensor Analysis, and Applications（#374716469808）