Vera Neidlein (Faculty of Economics and Management, Otto-von-Guericke University Magdeburg) Andrèa C. G. Vianna (Faculty of Economics and Management, Otto-von-Guericke University Magdeburg) Marcos N. Arenales (Faculty of Economics and Management, Otto-von-Guericke University Magdeburg) Gerhard Wäscher () (Faculty of Economics and Management, Otto-von-Guericke University Magdeburg)
Abstract
In this paper, a two-dimensional cutting problem is considered in which a single plate (large object) has to be cut down into a set of small items of maximal value. As opposed to standard cutting problems, the large object contains a defect, which must not be covered by a small item. The problem is represented by means of an AND/OR-graph, and a Branch & Bound procedure (including heuristic modifications for speeding up the search process) is introduced for its exact solution. The proposed method is evaluated in a series of numerical experiments that are run on problem instances taken from the literature, as well as on randomly generated instances.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Paper provided by Otto-von-Guericke University Magdeburg, Faculty of Economics and Management in its series FEMM Working Papers with number
08035.
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.: