Call Us 080-41656200 (Mon-Sat: 10AM-8PM)
Free Shipping above Rs. 1499
Cash On Delivery*

MIRUP Conjecture for Bin Packing in Low Dimension

 

Marketed By :  VDM Verlag Dr. Müller   Sold By :  Kamal Books International  
Delivery in :  10-12 Business Days

 

Check Your Delivery Options

 
Rs. 3,651

Availability: In stock

 
  • Product Description
 

Aim of this book is a computer proof for the MIRUP (modified integer roundup property) conjecture for Bin Packing in low dimension. Bin Packing is a well known combinatorial optimization problem (BPP), which appears as subprobem in many applications like scheduling. Two algorithms for an algorithmic approach to the MIRUP conjecture are presented. One works with generating possible knapsacks by picking subsets of possible patterns. It computes all relevant instances and checks MIRUP directly up to dimension 7. The running time for dimension 6 is less than a minute. A parallelised version takes less than 10 days by usage of 10 computation nodes for dimension 7. The other algorithm generates the knapsack instances using separating hyperplanes. It runs less than 5 hours on a single computation node to check dimension 6.

Product Specifications
SKU :COC22394
AuthorJaroslaw Klose
LanguageEnglish
BindingPaperback
Number of Pages68
Publishing Year9/19/2010
ISBN978-3639275889
Edition1 st
Book TypeMathematics
Country of ManufactureIndia
Product BrandVDM Verlag Dr. Müller
Product Packaging InfoBox
In The Box1 Piece
Product First Available On ClickOnCare.com2015-07-28 00:00:00