BRKGA/VND hybrid algorithm for the classic three-dimensional bin packing problem
type: Item
instance of: scholarly article
title: BRKGA/VND hybrid algorithm for the classic three-dimensional bin packing problem
zbMATH Open document ID: 1408.90354
author: Anderson Zudio
author: Daniel Henrique da Silva Costa
author: Bruno Porto Masquio
author: I. M. Coelho
author: Paulo E. D. Pinto
publication date: 2018-10-11T00:00:00Z
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6951759
zbMATH Keywords: bin packing
zbMATH Keywords: three-dimensional
zbMATH Keywords: BRKGA
zbMATH Keywords: VND
describes a project that uses: TSpack
MaRDI profile type: Publication
full work available at URL: j.endm.2018.03.023
OpenAlex ID: W2796752061
cites work: TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem
cites work: Guided local search for the three-dimensional bin-packing problem
cites work: Hybrid greedy heuristics based on linear programming for the three‐dimensional single bin‐size bin packing problem
cites work: Reducibility among Combinatorial Problems
cites work: Heuristic algorithms for the three-dimensional bin packing problem
cites work: TSpack: A unified tabu search code for multi-dimensional bin packing problems
cites work: The Three-Dimensional Bin Packing Problem
cites work: A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
Wikidata QID: Q129988561
DOI: 10.1016/J.ENDM.2018.03.023
description: scientific article; zbMATH DE number 6951759