PackIt! 1.0

(81 k)

Published by: Cognitive Software Downloads: 361 File Size: 81 Kb The download will take approximately minutes on 14.4 Kbps modem 28.8 Kbps modem 56 Kbps modem 64 Kbps ISDN 112 Kbps dual ISDN Corporate LAN 256 Kbps DSL/cable modem 384 Kbps DSL/cable modem 512 Kbps DSL/cable modem 786 Kbps DSL/cable modem License: SharewareTrial length: unlimited for development use. See EULA Price: $25.00 Product Homepage: Visit Cognitive Software   Link Broken? Report it! Release Date: 6/8/2006 OS: NT 2000 XP:Home XP:Pro Requires:: .NET framework 1.1 or 2.0 Download Locations: Primary Download   Link Broken? Report it!

Publisher's Description

PackIt! is a .NET API that can be used to divide an arbitrary collection of items into collections. For example, it can be used to separate a collection of files that is too large to fit on a singe CD into multiple sub-collections that can be burned across multiple CD. Alternatively, it can be used by an E-Commerce system to divide products into multiple shipments. PackIt! is a tool for developers. It is an application/domain generic API that can be integrated into whatever system you need. PackIt! is an implementation of the classic Bin Packing problem. It uses algorithms to divide items into sub-collections, wasting as little space is it can. Is it optimal? Well, yes and no. The Bin Packing problem is an NP Hard problem, which means that there is no optimal solution that can be provided in polynomial time. This means that finding an optimal solution to any but the smallest tasks is not feasible. We did implement an optimal problem solver, but it runs in O(n!) time, so for problems involving more than seven or eight items, we would recommend using the optimal packing option. There are however, a number of solutions that provide near optimal packaging that run much (MUCH!) faster. The API has a fast packing routine, though not guaranteed to be optimal, will come close. The fast algorithm runs in O(nlgn) time. Nearly linear.