Concepedia

Minimal proper non-IRUP instances of the one-dimensional cutting stock problem

Vadim Kartak, Artem V. Ripatti, Guntram Scheithauer, Sascha Kurz

Discrete Applied Mathematics · 2015 · 47 citations · 23 references

DOIFull text

Open access

Concepts

References

23

A Linear Programming Approach to the Cutting-Stock Problem

Paul C. Gilmore, Ralph E. Gomory · Operations Research · 1961 · 2K citations

, , +15

The cutting stock problem and integer rounding

Odile Marcotte · Mathematical Programming · 1985 · 103 citations

, , +10

A CLASS OF MAJORITY GAMES

John Isbell · The Quarterly Journal of Mathematics · 1956 · 98 citations

, , +11

Integer Rounding for Polymatroid and Branching Optimization Problems

Sanford Baum, L. E. Trotter · SIAM Journal on Algebraic and Discrete Methods · 1981 · 87 citations

, , +13

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

Guntram Scheithauer, Johannes Terno · European Journal of Operational Research · 1995 · 84 citations

, , +10