The cutting stock problem with mixed objectives: Two heuristics based on dynamic programming

DOI10.1016/S0377-2217(98)00163-5zbMath0935.90029OpenAlexW1967335485WikidataQ57186020 ScholiaQ57186020MaRDI QIDQ1296373

Chengbin Chu, Julien Antonio, Fabrice Chauvet, Jean Marie Proth

Publication date: 2 August 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(98)00163-5

zbMATH Keywords

dynamic programmingindustrial applicationsindustrial cutting stock problems

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Dynamic programming (90C39)

Related Items (4)

An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem ⋮ Dynamic programming for delayed product differentiation. ⋮ Multi-commodity supply network planning in the forest supply chain ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Packing problems
• A typology of cutting and packing problems
• Fast algorithms for bin packing
• A Linear Programming Approach to the Cutting-Stock Problem
• A New Linear Programming Approach to the Cutting Stock Problem

This page was built for publication: The cutting stock problem with mixed objectives: Two heuristics based on dynamic programming