Biblioteca.Net

HOME | LOGIN

Linear one-dimensional cutting-packing problems: numerical experiments with the sequential value correction method (SVC) and a modified branch-and-bound method (MBB)

Este recurso ha sido solicitado 1 veces (0 veces en los últimos 31 días).

Para poder solicitar este recurso debe identificarse como usuario de la biblioteca

Ver

Linear one-dimensional cutting-packing problems: numerical experiments with the sequential value correction method (SVC) and a modified branch-and-bound method (MBB)
Id.	517441
Idioma	inglés
Titulo	Linear one-dimensional cutting-packing problems: numerical experiments with the sequential value correction method (SVC) and a modified branch-and-bound method (MBB)
Autor(es)	Mukhacheva,E.A. Belov,G.N. Kartack,V.M. Mukhacheva,A.S.
Localización	http://www.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382000000200002
Versión	1.0
Estado	Final
Descripción	Two algorithms for the one-dimensional cutting problem, namely, a modified branch-and-bound method (exact method) and a heuristic sequential value correction method are suggested. In order to obtain a reliable assessment of the efficiency of the algorithms, hard instances of the problem were considered and from the computational experiment it seems that the efficiency of the heuristic method appears to be superior to that of the exact one, taking into account the computing time of the latter. A detailed description of the two methods is given along with suggestions for their improvements.
Tipo	text/html
Palabras clave	packing
Tipo de recurso	journal article
Tipo de Interactividad	Expositivo
Nivel de Interactividad	muy bajo
Audiencia	Estudiante Profesor Autor
Estructura	Atomic
Coste	no
Copyright	sí
Formatos	text/html
Requerimientos técnicos	Browser: Any
Fecha de contribución	23-may-2005
Contacto

No hay ninguna valoración para este recurso. Sea el primero en valorar este recurso.