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

Solving a cutting problem based on existing patterns

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

DOI10.1016/0377-2217(94)90036-1zbMath0810.90139OpenAlexW1979123056MaRDI QIDQ1333483

V. Pereyra

Publication date: 15 September 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)90036-1


zbMATH Keywords

cutting costcutting stack


Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10) Linear programming (90C05)


Related Items (2)

Heuristics for the combined cut order planning two-dimensional layout problem in the apparel industry ⋮ Alternative formulations for a layout problem in the fashion industry




Cites Work

  • Near-optimal solutions to one-dimensional cutting stock problems
  • Approximation solutions for the cutting stock `portfolio' problem
  • Optimal solutions for the cutting stock problem
  • Une étude pratique de découpes de panneaux de bois
  • Formalisation et résolution des problèmes de découpes linéaires
  • Unnamed Item
  • Unnamed Item




This page was built for publication: Solving a cutting problem based on existing patterns

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1333483&oldid=13471269"
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 13:25.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki