Alternative approaches for one-dimensional slitting problems

DOI10.1057/PALGRAVE.JORS.2600379zbMATH Open0890.90158OpenAlexW2075261312MaRDI QIDQ4367019FDOQ4367019

Author name not available (Why is that?)

Publication date: 25 November 1997

Published in: The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2600379

zbMATH Keywords

shortest pathacyclic algorithmone-dimensional slitting

Mathematics Subject Classification ID

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

Cited In (3)

• An Optimum Solution for One-Dimensional Slitting Problems: A Dynamic Programming Approach
• Solving sequential interval cutting problems via dynamic programming
• The condition for applying slit island method

   Recommendations

• An Optimum Solution for One-Dimensional Slitting Problems: A Dynamic Programming Approach 👍 👎
• Solving sequential interval cutting problems via dynamic programming 👍 👎
• One-dimensional cutting stock problems and solution procedures 👍 👎
• The cutting stock problem with mixed objectives: Two heuristics based on dynamic programming 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Alternative approaches for one-dimensional slitting problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4367019)