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

A search strategy for the one-size assortment problem

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

DOI10.1016/0377-2217(94)90211-9zbMath0803.90107OpenAlexW2010166637MaRDI QIDQ1330558

Horacio Hideki Yanasse

Publication date: 21 July 1994

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

Full work available at URL: https://doi.org/10.1016/0377-2217(94)90211-9


zbMATH Keywords

heuristicscutting stockassortmentoptimal length of a board


Mathematics Subject Classification ID

Combinatorial optimization (90C27)





Cites Work

  • Two-dimensional Cutting Stock with Multiple Stock Sizes
  • Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography




This page was built for publication: A search strategy for the one-size assortment problem

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