Heuristic algorithm for a cutting stock problem in the steel bridge construction
From MaRDI portal
Publication:954060
DOI10.1016/j.cor.2007.10.019zbMath1157.90504OpenAlexW2036121524MaRDI QIDQ954060
Publication date: 7 November 2008
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2007.10.019
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
Uses Software
Cites Work
- Unnamed Item
- A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem
- An application of simulated annealing to the cutting stock problem
- Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach
- The cutting stock problem in a hardboard industry: A case study.
- A computational study of LP-based heuristic algorithms for two-dimensional guillotine cutting stock problems
- A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
- A new heuristic recursive algorithm for the strip rectangular packing problem
- An improved typology of cutting and packing problems
- A Mixed Integer Programming Model for Solving a Layout Problem in the Fashion Industry
- A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem
- Effective nesting of rectangular parts in multiple rectangular sheets using genetic and heuristic algorithms
- Multi-job Cutting Stock Problem with Due Dates and Release Dates
- Multistage Cutting Stock Problems of Two and More Dimensions