Applications of Cutting Stock Problem
Copyright policy )Applications of Cutting Stock Problem
We present one heuristic solution for the well-known cutting stock problem which was formulated by Kantorovich in 1939. It is the problem of filling an order at minimum cost for specified numbers of lengths of material to be cut to given stock lengths of given cost. When expressed as an integer programming problem the large number of variables involved generally makes computation infeasible. The same difficulty persists when only an approximate solution is being sought by linear programming.
- University of Žilina Slovakia
cutting stock, Transportation engineering, model, optimal solution, TA1001-1280, Science, Q, linear programming, lower bound, Transportation and communications, HE1-9990
cutting stock, Transportation engineering, model, optimal solution, TA1001-1280, Science, Q, linear programming, lower bound, Transportation and communications, HE1-9990
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).1 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!