Online dominating set
J Boyar, SJ Eidenbenz, LM Favrholdt, M Kotrbčík… - Algorithmica, 2019 - Springer
This paper is devoted to the online dominating set problem and its variants. We believe the
paper represents the first systematic study of the effect of two limitations of online algorithms …
paper represents the first systematic study of the effect of two limitations of online algorithms …
VNS matheuristic for a bin packing problem with a color constraint
Y Kochetov, A Kondakov - Electronic Notes in Discrete Mathematics, 2017 - Elsevier
We study a new variant of the bin packing problem. Given a set of items, each item has a set
of colors. Each bin has a color capacity, the total number of colors for a bin is the union of …
of colors. Each bin has a color capacity, the total number of colors for a bin is the union of …
Binary decision diagrams for bin packing with minimum color fragmentation
Abstract Bin Packing with Minimum Color Fragmentation (BPMCF) is an extension of the Bin
Packing Problem in which each item has a size and a color and the goal is to minimize the …
Packing Problem in which each item has a size and a color and the goal is to minimize the …
Generalized Graph k-Coloring Games
R Carosi, G Monaco - International Computing and Combinatorics …, 2018 - Springer
We investigate pure Nash equilibria in generalized graph k-coloring games where we are
given an edge-weighted undirected graph together with a set of k colors. Nodes represent …
given an edge-weighted undirected graph together with a set of k colors. Nodes represent …
Colored bin packing: Online algorithms and lower bounds
Abstract In the Colored Bin Packing problem a sequence of items of sizes up to 1 arrives to
be packed into bins of unit capacity. Each item has one of at least two colors and an …
be packed into bins of unit capacity. Each item has one of at least two colors and an …
[HTML][HTML] Offline black and white bin packing
We define and study a variant of bin packing called unrestricted black and white bin packing.
Similarly to standard bin packing, a set of items of sizes in [0, 1] are to be partitioned into …
Similarly to standard bin packing, a set of items of sizes in [0, 1] are to be partitioned into …
Towards bin packing (preliminary problem survey, models with multiset estimates)
MS Levin - arXiv preprint arXiv:1605.07574, 2016 - arxiv.org
The paper described a generalized integrated glance to bin packing problems including a
brief literature survey and some new problem formulations for the cases of multiset estimates …
brief literature survey and some new problem formulations for the cases of multiset estimates …
Variants of Classical One Dimensional Bin Packing
J Csirik, C Imreh - Handbook of approximation algorithms and …, 2018 - taylorfrancis.com
This chapter discusses the variant in which the number of items packed is maximized. It
describes a variant that places a bound on the number of items that can be packed in each …
describes a variant that places a bound on the number of items that can be packed in each …
Online packing of arbitrary sized items into designated and multipurpose bins
N Goldberg, S Karhi - European Journal of Operational Research, 2019 - Elsevier
We consider an online multitype bin-packing problem with two item types. This setting can
be motivated by transport applications in which some items may be shipped either in dry …
be motivated by transport applications in which some items may be shipped either in dry …
Fast Neighborhood Search Heuristics for the Colorful Bin Packing Problem
RFF da Silva, YGF Borges, R Schouery - arXiv preprint arXiv:2310.04471, 2023 - arxiv.org
The Colorful Bin Packing Problem (CBPP) is a generalization of the Bin Packing Problem
(BPP). The CBPP consists of packing a set of items, each with a weight and a color, in bins …
(BPP). The CBPP consists of packing a set of items, each with a weight and a color, in bins …