The modified integer round-up property of the one-dimensional cutting stock problem

Article Abstract:

The one-dimensional cutting stock problem was numerically analyzed to determine whether it possesses the modified integer round-up property. The latter is inherent in linear integer minimization problems (IP) where the 'optimal value of any instance of IP is lesser than than the optimal value of the corresponding linear programming relaxation problems rounded up plus one.' The results were obtained via a procedure that may also be used as a heuristic to solve the cutting-stock problem.

Research, Case studies, Integer programming, Cutting

---

The solution of two-stage guillotine cutting stock problems having extremely varying order demands

Article Abstract:

Two-stage guillotine cutting stock problems are analyzed and solved. The focus is on problems where the sizes of the order demands vary substantially. A new strategy called the stripe approach is suggested which permits the consideration of widely varying order demands. The stripe method is contrasted with the Gilmore-Gomory method. Several numerical experiments are conducted to illustrate the benefits of the new method.

Usage, Inventory control

---

An efficient approach for the multi-pallet loading problem

Article Abstract:

The multi-pallet loading problem is considered.

Methods, Materials handling

Similar abstracts:

• Abstracts: The hollow promise of Internet banking. Breaking cover. Paying respects
• Abstracts: The precarious politics of prosperity. Head to head, neck and neck
• Abstracts: London is losing ground. Twist in the low-cost tale. Landmark decision gives go-ahead for Galileo
• Abstracts: A note on exact algorithms for the bottleneck generalized assignment problem. New trends in exact algorithms for the 0-1 knapsack problem
• Abstracts: An exact algorithm for large multiple knapsack problems. The inverse-parametric knapsack problem. Approximation algorithms for knapsack problems with cardinality constraints

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.