A Linear Programming Approach to the Cutting-Stock Problem

Gilmore, P. C., & Gomory, R. E. (1961). A Linear Programming Approach to the Cutting-Stock Problem. Operations Research, 9(6), 849-859.

Type

Journal article

Intellectual base

Primary research

Year

1961

Volume

9

Issue

6

Pages

849-859

DOI

10.1287/opre.9.6.849

DOI registrant

Institute for Operations Research and the Management Sciences

Link

https://doi.org/10.1287/opre.9.6.849

Cited by

1 citation across 1 artifact.

Domain-specific

• Cutting Stock Problem
  • Gilmore and Gomory's original one-dimensional statement is explicit about required numbers of lengths, given stock lengths and costs, and minimum-cost order fulfillment.

Verification

Does it exist? Not checked yet. This work's DOI is recorded above but has not been resolved against an external catalogue, so nothing here confirms the work exists.

Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Registry ID ref:11847f6a0378 · see in the full table