A Linear Programming Approach to the Cutting-Stock Problem

DOI Web Site 被引用文献12件
  • P. C. Gilmore
    International Business Machines Corporation, Research Center, Yorktown, New York
  • R. E. Gomory
    International Business Machines Corporation, Research Center, Yorktown, New York

この論文をさがす

抄録

<jats:p> The cutting-stock problem is the problem of filling an order at minimum cost for specified numbers of lengths of material to be cut from given stock lengths of given cost. When expressed as an integer programming problem the large number of variables involved generally makes computation infeasible. This same difficulty persists when only an approximate solution is being sought by linear programming. In this paper, a technique is described for overcoming the difficulty in the linear programming formulation of the problem. The technique enables one to compute always with a matrix which has no more columns than it has rows. </jats:p>

収録刊行物

  • Operations Research

    Operations Research 9 (6), 849-859, 1961-12

    Institute for Operations Research and the Management Sciences (INFORMS)

被引用文献 (12)*注記

もっと見る

キーワード

詳細情報 詳細情報について

問題の指摘

ページトップへ