Partitioning Algorithms for a Class of Knapsack Problems (Classic Reprint)

Language: English

Published by Forgotten Books, 2018

133227434X / 9781332274345

  • Softcover
  • New
See all details
Item image 1 of 2.

Seller: Forgotten Books, London, United KingdomForgotten Books

5-star seller

AbeBooks seller since June 2, 2021

Softcover

Condition: New

£ 14.27

 Free Shipping 
Ships from United Kingdom to U.S.A.

Quantity: Over 20 available

Add to basket
Free 30-day returns

Item description from seller

Print on Demand. This book explores the intricate world of knapsack problems, a fundamental concept in optimization theory that has far-reaching applications in various fields. The author delves into the historical roots of this problem, tracing its origins back to the work of Dantzig and Gilmore and Gomory. The book then examines the complexities of multi-dimensional knapsack problems, particularly those arising in cutting stock problems involving staged guillotine cutting operations. The author meticulously analyzes the theoretical underpinnings of knapsack problems, exploring the concept of optimal solutions and their descendents. He presents a range of algorithms designed to efficiently evaluate the knapsack function, including controlled interval search procedures and controlled parent-generation search procedures. Through a comprehensive exploration of these algorithms, the book sheds light on the efficiency and limitations of various approaches to solving knapsack problems. By providing a deep understanding of the intricacies of these problems, the book offers invaluable insights for researchers and practitioners working in fields such as operations research, computer science, and engineering. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book.…

Seller Inventory # 9781332274345_0

Title
Partitioning Algorithms for a Class of Knapsack Problems (Classic Reprint)
Author
John F. Pierce
Publisher
Forgotten Books
Publication year
2018
Condition
New
Book Type
print-on-demand item
Binding
Paperback
Language
English
ISBN 10
133227434X
ISBN 13
9781332274345
Seller catalogs
Calculus

Forgotten Books

London, United Kingdom

5-star seller

AbeBooks seller since June 2, 2021

Shipping rates from United Kingdom to U.S.A.

Item5 to 10 business days5 to 10 business days
First item£ 0.00£ 0.00
Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.

Payment methods

  • Visa
  • Mastercard
  • American Express
  • Apple Pay
  • Google Pay

Store description

Forgotten Books’ Classic Reprint Series utilizes the latest technology to regenerate facsimiles of historically important writings. Careful attention has been made to accurately preserve the original format of each page whilst digitally enhancing the quality of the aged text.

Specialty

Trade

Seller's business information

FB &c Ltd

Dalton House, 60 Windsor Avenue
London, United Kingdom SW19 2RR