scientific article; zbMATH DE number 3999654
From MaRDI portal
Publication:4726042
zbMath0616.90044MaRDI QIDQ4726042
No author found.
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Numerical mathematical programming methods (65K05) Integer programming (90C10) Fractional programming (90C32)
Related Items (17)
A branch-and-price-and-cut algorithm for the pattern minimization problem ⋮ Practical adaptations of the Gilmore-Gomory approach to cutting stock problems ⋮ Alternative configurations for cutting machines in a tube cutting mill ⋮ In situ column generation for a cutting-stock problem ⋮ Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem ⋮ The modified integer round-up property of the one-dimensional cutting stock problem ⋮ CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem ⋮ A new model for complete solutions to one-dimensional cutting stock problems. ⋮ Pattern minimisation in cutting stock problems ⋮ Knowledge based approach to the cutting stock problem ⋮ An effective solution for a real cutting stock problem in manufacturing plastic rolls ⋮ Setup minimising conditions in the trim loss problem ⋮ A one-dimensional cutting stock problem in the aluminium industry and its solution ⋮ An LP-based approach to cutting stock problems with multiple objectives ⋮ Optimal solutions for the cutting stock problem ⋮ One-dimensional cutting stock problem to minimize the number of different patterns ⋮ Enforcing minimum run length in the cutting stock problem
This page was built for publication: