Vector bin packing with heterogeneous bins: application to the machine reassignment problem
type: Item
instance of: scholarly article
title: Vector bin packing with heterogeneous bins: application to the machine reassignment problem
zbMATH Open document ID: 1348.90540
author: Michaël Gabay
author: Sofia Zaourar
published in: Annals of Operations Research
publication date: 2016-11-07T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6648429
zbMATH Keywords: vector bin packing with heterogeneous bins
zbMATH Keywords: machine reassignment problem
zbMATH Keywords: heuristics
zbMATH Keywords: virtual machine placement
zbMATH Keywords: vector bin packing
describes a project that uses: Bison
MaRDI profile type: Publication
full work available at URL: s10479-015-1973-7
OpenAlex ID: W2098909968
cites work: Q4339078
cites work: Multiple-type, two-dimensional bin packing problems: Applications and algorithms
cites work: Bin packing and related problems: general arc-flow formulation with graph compression
cites work: Lower bounds and algorithms for the 2-dimensional vector packing problem
cites work: Approximation schemes for ordered vector packing problems
cites work: A two-dimensional vector packing model for the efficient use of coil cassettes
cites work: Q4252288
cites work: Exact solution of bin-packing problems using column generation and branch-and-bound
cites work: A probabilistic heuristic for a computationally difficult set covering problem
cites work: Greedy randomized adaptive search procedures
cites work: Q4198056
cites work: Resource constrained scheduling as generalized bin packing
cites work: Variable neighborhood search for Google machine reassignment problem
cites work: Resource allocation algorithms for virtualized service hosting platforms
cites work: Multidimensional Bin Packing Algorithms
cites work: Heuristics and matheuristics for a real‐life machine reassignment problem
cites work: New Algorithms for Bin Packing
cites work: There is no asymptotic PTAS for two-dimensional vector packing
cites work: BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
cites work: Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
cites work: A branch-and-bound algorithm for the two-dimensional vector packing problem
DOI: 10.1007/S10479-015-1973-7
description: scientific article; zbMATH DE number 6648429