Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A cutting stock problem and its solution in the manufacturing industry of large electric generators

From MaRDI portal
Publication:1777147
Jump to:navigation, search

DOI10.1016/j.cor.2003.11.022zbMath1075.90024OpenAlexW2048911564MaRDI QIDQ1777147

Yaodong Cui

Publication date: 12 May 2005

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2003.11.022


zbMATH Keywords

Cutting stock problemTwo-dimensional cuttingSilicon steel sheet


Mathematics Subject Classification ID

Production models (90B30)


Related Items (3)

Renovation of the cutting stock process ⋮ Dynamic programming algorithms for generating optimal strip layouts ⋮ Modified greedy heuristic for the one-dimensional cutting stock problem


Uses Software

  • TOPOS


Cites Work

  • Unnamed Item
  • A generic approach for nesting of 2-D parts in 2-D sheets using genetic and heuristic algorithms
  • Unbounded knapsack problem: Dynamic programming revisited
  • A 2-exchange heuristic for nesting problems
  • LP models for bin packing and cutting stock problems
  • A Linear Programming Approach to the Cutting-Stock Problem


This page was built for publication: A cutting stock problem and its solution in the manufacturing industry of large electric generators

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1777147&oldid=14124805"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 07:51.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki