AN AND OR-GRAPH APPROACH FOR 2-DIMENSIONAL CUTTING PROBLEMS

dc.creatorMORABITO, RN
dc.creatorARENALES, MN
dc.creatorARCARO, VF
dc.date1992
dc.dateAPR 27
dc.date2014-12-16T11:36:26Z
dc.date2015-11-26T17:24:52Z
dc.date2014-12-16T11:36:26Z
dc.date2015-11-26T17:24:52Z
dc.date.accessioned2018-03-29T00:12:09Z
dc.date.available2018-03-29T00:12:09Z
dc.identifierEuropean Journal Of Operational Research. Elsevier Science Bv, v. 58, n. 2, n. 263, n. 271, 1992.
dc.identifier0377-2217
dc.identifierWOS:A1992JB87100010
dc.identifier10.1016/0377-2217(92)90212-R
dc.identifierhttp://www.repositorio.unicamp.br/jspui/handle/REPOSIP/54314
dc.identifierhttp://www.repositorio.unicamp.br/handle/REPOSIP/54314
dc.identifierhttp://repositorio.unicamp.br/jspui/handle/REPOSIP/54314
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1284186
dc.descriptionThe problem of generating guillotine cutting patterns for a rectangular plate is studied and a type of structure is proposed for representing the solution of the problem, called and-or graph, which is commonly used in the Artificial Intelligence environment. To search the graph we combined two classical strategies: depth-first and hill-climbing. Further, some heuristics are considered and computational results are presented, relating their performance on examples from both literature as well as randomly generated.
dc.description58
dc.description2
dc.description263
dc.description271
dc.languageen
dc.publisherElsevier Science Bv
dc.publisherAmsterdam
dc.publisherHolanda
dc.relationEuropean Journal Of Operational Research
dc.relationEur. J. Oper. Res.
dc.rightsfechado
dc.rightshttp://www.elsevier.com/about/open-access/open-access-policies/article-posting-policy
dc.sourceWeb of Science
dc.subjectCUTTING STOCK PROBLEM
dc.subjectAND OR-GRAPH SEARCH
dc.titleAN AND OR-GRAPH APPROACH FOR 2-DIMENSIONAL CUTTING PROBLEMS
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución