Journal ArticleDOI
VNS matheuristic for a bin packing problem with a color constraint
Yury Kochetov,A. Kondakov +1 more
TLDR
This work studies a new variant of the bin packing problem that wants to pack all items into the minimal number of bins and applies the column generation technique based on the VNS matheuristic for the pricing problem.About:
This article is published in Electronic Notes in Discrete Mathematics.The article was published on 2017-04-01. It has received 13 citations till now. The article focuses on the topics: Bin packing problem & Bin.read more
Citations
More filters
Journal Article
The Class Constrained Bin Packing Problem with Applications to Video-on-Demand
TL;DR: In this article, the authors present approximation results for the class constrained bin packing problem that has applications to Video-on-Demand Systems, where each bin contains items of at most C different classes and has total items size at most B. They also present several approximation algorithms for off-line and online versions of the problem.
Book ChapterDOI
Binary Decision Diagrams for Bin Packing with Minimum Color Fragmentation.
TL;DR: In this article, a decomposition strategy was proposed to solve the bin packing with minimum color fragmentation problem, where the assignment of items to bins was formulated as a binary decision diagram and an optimal integrated solution was identified through a mixed-integer linear programming model.
Book ChapterDOI
A Core Heuristic and the Branch-and-Price Method for a Bin Packing Problem with a Color Constraint
Artem Kondakov,Yury Kochetov +1 more
TL;DR: This work designs the core heuristic based on the column generation approach for the large-scale formulation of bin packing problem with a color constraint and uses it in the exact branch-and-price method.
Proceedings ArticleDOI
A special case of Variable-Sized Bin Packing Problem with Color Constraints
TL;DR: A special case of VSBPP-CC where each color is assigned to only one item is considered and preliminary computational results show the efficiency of the formulations, mainly the so-called matching formulation, in solving CSPLIB-based instances.
Journal ArticleDOI
Exact algorithms for class-constrained packing problems
TL;DR: The best algorithm for CCBPP was able to solve 95 % of the instances considered in less than 15 min and two dynamic programming algorithms and a Branch-and-Bound algorithm are presented for generalizations of CCKP.
References
More filters
Journal ArticleDOI
Variable neighborhood search: Principles and applications
Pierre Hansen,Nenad Mladenović +1 more
TL;DR: In this article, a simple and effective metaheuristic for combinatorial and global optimization, called variable neighborhood search (VNS), is presented, which can easily be implemented using any local search algorithm as a subroutine.
Journal ArticleDOI
Algorithms for the Bin Packing Problem with Conflicts
TL;DR: New lower bounds, upper bounds, and an exact approach are presented, based on a set covering formulation solved through a branch-and-price algorithm, for a particular bin packing problem in which some pairs of items may be in conflict and cannot be assigned to the same bin.
Journal ArticleDOI
Polynomial time approximation schemes for class-constrained packing problems
Hadas Shachnai,Tami Tamir +1 more
TL;DR: In this paper, a polynomial time approximation scheme was proposed for the class-constrained multiple knapsack (CCMK) problem and a dual PTAS for the CCBP problem.
Journal ArticleDOI
An Approximation Scheme for Bin Packing with Conflicts
TL;DR: An asymptotic approximation scheme for the bin packing problem with conflicts restricted to d-inductive graphs with constant d is proposed, which finds an assignment for the items such that the generated number of bins is within a factor of (1 + ∈) of optimal provided that the optimum number is sufficiently large.
Journal ArticleDOI
Covering graphs with few complete bipartite subgraphs
TL;DR: In this article, the authors considered the problem of covering bipartite subgraphs with bicliques and showed that the problem is fixed-parameter tractable unless P = NP.