Bibliographic citations
This is an automatically generated citacion. Modify it if you see fit
Delgadillo, R., (2007). Un estudio algorítmico del problema de corte y empaquetado 2d [Tesis, Universidad Nacional Mayor de San Marcos]. https://hdl.handle.net/20.500.12672/1518
Delgadillo, R., Un estudio algorítmico del problema de corte y empaquetado 2d [Tesis]. PE: Universidad Nacional Mayor de San Marcos; 2007. https://hdl.handle.net/20.500.12672/1518
@misc{renati/474405,
title = "Un estudio algorítmico del problema de corte y empaquetado 2d",
author = "Delgadillo Avila, Rosa Sumactika",
publisher = "Universidad Nacional Mayor de San Marcos",
year = "2007"
}
Title: Un estudio algorítmico del problema de corte y empaquetado 2d
Authors(s): Delgadillo Avila, Rosa Sumactika
Advisor(s): Berger Vidal, Esther
Keywords: Problema de corte; Empaquetado; Optimización combinatoria; Algoritmos
OCDE field: https://purl.org/pe-repo/ocde/ford#1.01.02
Issue Date: 2007
Institution: Universidad Nacional Mayor de San Marcos
Abstract: El problema de corte y empaquetado en dos dimensiones, es un problema NP- difícil perteneciente a la familia de problemas de la optimización combinatoria. El problema combinatorio estriba en la gran cantidad de patrones de corte que puede construirse a partir de un número determinado de requerimientos y un conjunto de objetos los cuales deben ser cortados para satisfacer estos. Este problema es muy importante debido a la gran cantidad de aplicaciones que tiene en la industria. En este trabajo presentamos un estudio de los diferentes métodos que resuelven el problema, clasificándolos por métodos exactos, heurísticas y meta heurísticas. También presentamos conceptos, modelos del problema y las relaciones con otros problemas combinatorios.
-- Two dimensional cutting and packing problems is NP-hard, it belong to the family of problems of the optimization combinatory. This problem is based in the great amount of cut patterns that can be constructed from a determined number of requirements and a set of objects which must be cut to satisfy these. This problem is very important because it presents enormous applicability in the industry. In this work we presented a study of the different methods that solve the problem, classifying them by exact methods, heuristic and meta heuristic. Also we presented concepts, models and the relations with other combinatory problems.
-- Two dimensional cutting and packing problems is NP-hard, it belong to the family of problems of the optimization combinatory. This problem is based in the great amount of cut patterns that can be constructed from a determined number of requirements and a set of objects which must be cut to satisfy these. This problem is very important because it presents enormous applicability in the industry. In this work we presented a study of the different methods that solve the problem, classifying them by exact methods, heuristic and meta heuristic. Also we presented concepts, models and the relations with other combinatory problems.
Link to repository: https://hdl.handle.net/20.500.12672/1518
Discipline: Investigación Operativa
Grade or title grantor: Universidad Nacional Mayor de San Marcos. Facultad de Ciencias Matemáticas. Escuela Académico Profesional de Investigación Operativa
Grade or title: Licenciado en Investigación Operativa
Register date: 20-Aug-2013
This item is licensed under a Creative Commons License