Displaying similar documents to “A note on dual approximation algorithms for class constrained bin packing problems”

Algorithms for the two dimensional bin packing problem with partial conflicts

Khaoula Hamdi-Dhaoui, Nacima Labadie, Alice Yalaoui (2012)

RAIRO - Operations Research

Similarity:

The two-dimensional bin packing problem is a well-known problem for which several exact and approximation methods were proposed. In real life applications, such as in Hazardous Material transportation, transported items may be partially incompatible, and have to be separated by a safety distance. This complication has not yet been considered in the literature. This paper introduces this extension called the two-dimensional bin packing problem with partial conflicts (2BPPC) which is a...

Algorithms for the two dimensional bin packing problem with partial conflicts

Khaoula Hamdi-Dhaoui, Nacima Labadie, Alice Yalaoui (2012)

RAIRO - Operations Research

Similarity:

The two-dimensional bin packing problem is a well-known problem for which several exact and approximation methods were proposed. In real life applications, such as in Hazardous Material transportation, transported items may be partially incompatible, and have to be separated by a safety distance. This complication has not yet been considered in the literature. This paper introduces this extension called the two-dimensional bin packing problem with partial conflicts (2BPPC) which is a...

Packings of pairs with a minimum known number of quadruples

Jiří Novák (1995)

Mathematica Bohemica

Similarity:

Let E be an n -set. The problem of packing of pairs on E with a minimum number of quadruples on E is settled for n < 15 and also for n = 36 t + i , i = 3 , 6 , 9 , 12 , where t is any positive integer. In the other cases of n methods have been presented for constructing the packings having a minimum known number of quadruples.

Packing Parameters in Graphs

I. Sahul Hamid, S. Saravanakumar (2015)

Discussiones Mathematicae Graph Theory

Similarity:

In a graph G = (V,E), a non-empty set S ⊆ V is said to be an open packing set if no two vertices of S have a common neighbour in G. An open packing set which is not a proper subset of any open packing set is called a maximal open packing set. The minimum and maximum cardinalities of a maximal open packing set are respectively called the lower open packing number and the open packing number and are denoted by ρoL and ρo. In this paper, we present some bounds on these parameters. ...