Solving one-dimensional cutting stock problem with discrete demands and capacitated planning objective.(Report): An article from: Journal of Mathematics and Statistics

This digital document is an article from Journal of Mathematics and Statistics, published by Science Publications on April 1, 2010. The length of the article is 3212 words. The page length shown above is based on a typical 300-word page. The article is delivered in HTML format and is available immediately after purchase. You can view it with any web browser.

From the author: Key words: Stochastic integer linear programming, cutting stock problems, column-generation technique, heuristics

Citation Details
Title: Solving one-dimensional cutting stock problem with discrete demands and capacitated planning objective.(Report)
Author: Sirirat Wongprakornkul
Publication:Journal of Mathematics and Statistics (Magazine/Journal)
Date: April 1, 2010
Publisher: Science Publications
Volume: 6 Issue: 2 Page: 79(5)

Article Type: Report

Distributed by Gale, a part of Cengage Learning