VNS matheuristic for a bin packing problem with a color constraint
type: Item
instance of: scholarly article
title: VNS matheuristic for a bin packing problem with a color constraint
zbMATH Open document ID: 1388.90104
author: Peng Zhang
publication date: 2018-01-04T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6821794
zbMATH Keywords: matheuristic
zbMATH Keywords: local search
zbMATH Keywords: large neighborhood
zbMATH Keywords: column generation
describes a project that uses: Gurobi
MaRDI profile type: Publication
full work available at URL: j.endm.2017.03.006
OpenAlex ID: W2606582384
cites work: Black and White Bin Packing
cites work: Online Colored Bin Packing
cites work: Variable sized bin packing with color constraints
cites work: Covering graphs with few complete bipartite subgraphs
cites work: Variable neighborhood search: Principles and applications
cites work: An approximation scheme for bin packing with conflicts
cites work: Algorithms for the bin packing problem with conflicts
cites work: The Co-Printing Problem: A Packing Problem with a Color Constraint
cites work: Polynomial time approximation schemes for class-constrained packing problems
cites work: The class constrained bin packing problem with applications to video-on-demand
DOI: 10.1016/J.ENDM.2017.03.006
description: scientific article; zbMATH DE number 6821794