Cutting Stock, Linear Programming, Knapsacking, Dynamic Programming and Integer Programming, Some Interconnections

DOI10.1016/S0167-5060(08)70828-8zbMath0409.90062OpenAlexW189466147MaRDI QIDQ4197625

Paul C. Gilmore

Publication date: 1979

Published in: Discrete Optimization I, Proceedings of the Advanced Research Institute on Discrete Optimization and Systems Applications of the Systems Science Panel of NATO and of the Discrete Optimization Symposium (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-5060(08)70828-8

zbMATH Keywords

Dynamic ProgrammingKnapsack ProblemLinear Integer ProgrammingCutting Stock

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Dynamic programming (90C39)

Related Items (6)

Heuristics for the integer one-dimensional cutting stock problem: A computational study ⋮ An approximation algorithm for solving unconstrained two-dimensional knapsack problems ⋮ A mathematical modeling approach to optimize composite parts placement in autoclave ⋮ A typology of cutting and packing problems ⋮ LP models for bin packing and cutting stock problems ⋮ Conjugate duality and the curse of dimensionality

This page was built for publication: Cutting Stock, Linear Programming, Knapsacking, Dynamic Programming and Integer Programming, Some Interconnections