Pascal and Francis Bibliographic Databases

Help

Export

Selection :

Permanent link
http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=21309164

TS2PACK : A two-level tabu search for the three-dimensional bin packing problem

Author
CRAINIC, Teodor Gabriel1 ; PERBOLI, Guido2 ; TADEI, Roberto2
[1] Département de management et technologie, École des sciences lie la gestion, U.Q.A.M. and CIRRELT, Montreal, Canada
[2] Control and Computer Engineering Department, Politecnico di Torino, Torino, Italy
Conference name
IFAC INCOM'06 Symposium
Source

European journal of operational research. 2009, Vol 195, Num 3, pp 744-760, 17 p ; ref : 29 ref

CODEN
EJORDT
ISSN
0377-2217
Scientific domain
Control theory, operational research
Publisher
Elsevier, Amsterdam
Publication country
Netherlands
Document type
Conference Paper
Language
English
Author keyword
Bin packing Tabu search Three-dimensional packing
Keyword (fr)
Complexité algorithme Graphe intervalle Optimisation combinatoire Problème NP difficile Problème recherche Problème remplissage Recherche tabou Théorie graphe
Keyword (en)
Algorithm complexity Interval graph Combinatorial optimization NP hard problem Search problem Bin packing problem Tabu search Graph theory
Keyword (es)
Complejidad algoritmo Grafo intervalo Optimización combinatoria Problema NP duro Problema investigación Problema relleno Búsqueda tabú Teoría grafo
Classification
Pascal
001 Exact sciences and technology / 001D Applied sciences / 001D01 Operational research. Management science / 001D01A Operational research and scientific management / 001D01A04 Flows in networks. Combinatorial problems

Discipline
Operational research. Management
Origin
Inist-CNRS
Database
PASCAL
INIST identifier
21309164

Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS

Access to the document

Searching the Web