Algorithms for the two dimensional bin packing problem with partial conflicts

Khaoula Hamdi-Dhaoui; Nacima Labadie; Alice Yalaoui

The search session has expired. Please query the service again.

Displaying similar documents to “Algorithms for the two dimensional bin packing problem with partial conflicts”

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...

Analysis of transmissions scheduling with packet fragmentation.

Menakerman, Nir, Rom, Raphael (2001)

Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]

Similarity:

Solving the Two-Dimensional Packing Problem With m-M Calculus

Aleksandar Savić, Tijana Šukilović, Vladimir Filipović (2011)

The Yugoslav Journal of Operations Research

Similarity:

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. ...

A note on dual approximation algorithms for class constrained bin packing problems

Eduardo C. Xavier, Flàvio Keidi Miyazawa (2009)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

In this paper we present a dual approximation scheme for the class constrained shelf bin packing problem. In this problem, we are given bins of capacity $1$ , and $n$ items of $Q$ different classes, each item $e$ with class $c_{e}$ and size $s_{e}$ . The problem is to pack the items into bins, such that two items of different classes packed in a same bin must be in different shelves. Items in a same shelf are packed consecutively. Moreover, items in consecutive shelves must be separated by shelf divisors...

L. V. Kantorovich and cutting-packing problems: new approaches for solving combinatorial problems of linear cutting and rectangular packing.

Mukhacheva, È.A., Mukhacheva, A.S. (2004)

Journal of Mathematical Sciences (New York)

Similarity:

The densest packing of 12 congruent circles in a circle.

Fodor, Ferenc (2000)

Beiträge zur Algebra und Geometrie

Similarity:

Improving dense packings of equal disks in a square.

Boll, W.David, Donovan, Jerry, Graham, Ronald L., Lubachevsky, Boris D. (2000)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Universal container for packing rectangles

Janusz Januszewski (2002)

Colloquium Mathematicae

Similarity:

The aim of the paper is to find a rectangle with the least area into which each sequence of rectangles of sides not greater than 1 with total area 1 can be packed.

A literature review on circle and sphere packing problems: models and methodologies.

Hifi, Mhand, M'hallah, Rym (2009)

Advances in Operations Research

Similarity:

Dense packings of equal disks in an equilateral triangle: From 22 to 34 and beyond.

Graham, R.L., Lubachevsky, B.D. (1995)

The Electronic Journal of Combinatorics [electronic only]

Similarity: