International audienceWe consider the 3-stage two-dimensional bin packing problem , which occurs in real-world problems such as glass cutting. For it, we present a new integer linear programming formulation and a branch and price algorithm. Column generation is performed by applying either a greedy heuristic or an Evolutionary Algorithm (EA). Computational experiments show the benefits of the EA-based approach. The higher computational effort of the EA pays off in terms of better final solutions; furthermore more instances can be solved to provable optimality
This paper considers a non-oriented twodimensional bin packing problem, where a set of small recta...
A bin packing (BP) problem is an industrial problem that arises when grouping items into appropriate...
Abstract. Problem statement: Cutting and packing (C and P) problems are optimization problems that a...
International audienceWe consider the 3-stage two-dimensional bin packing problem , which occurs in ...
We consider the 3-stage two-dimensional bin packing problem, which occurs in real-world problems suc...
International audienceWe consider the three-stage two-dimensional bin packing problem (2BP) which oc...
We consider the three-stage two-dimensional bin packing problem (2BP) which occurs in real-world app...
AbstractCombinatorial optimization problems dealing with 2D bin packing find applications, for examp...
<p>For every set of bin packing data there exists a unique ordering which produces the optimal solut...
We address two two-dimensional bin packing problems where the bins are rectangular and have the same...
Large-neighbourhood search (LNS) heuristics are important mathematical programming techniques that s...
The bin-packing problem is a well known NP-Hard optimisation problem, and, over the years, many heu...
This paper studies a variant of the three-dimensional bin packing problem (3D-BPP), where the bin he...
In this paper a two-dimensional non-oriented guillotine bin packing problem is studied when items ha...
A novel evolutionary approach for the bin packing problem (BPP) is presented. A simple steady-state ...
This paper considers a non-oriented twodimensional bin packing problem, where a set of small recta...
A bin packing (BP) problem is an industrial problem that arises when grouping items into appropriate...
Abstract. Problem statement: Cutting and packing (C and P) problems are optimization problems that a...
International audienceWe consider the 3-stage two-dimensional bin packing problem , which occurs in ...
We consider the 3-stage two-dimensional bin packing problem, which occurs in real-world problems suc...
International audienceWe consider the three-stage two-dimensional bin packing problem (2BP) which oc...
We consider the three-stage two-dimensional bin packing problem (2BP) which occurs in real-world app...
AbstractCombinatorial optimization problems dealing with 2D bin packing find applications, for examp...
<p>For every set of bin packing data there exists a unique ordering which produces the optimal solut...
We address two two-dimensional bin packing problems where the bins are rectangular and have the same...
Large-neighbourhood search (LNS) heuristics are important mathematical programming techniques that s...
The bin-packing problem is a well known NP-Hard optimisation problem, and, over the years, many heu...
This paper studies a variant of the three-dimensional bin packing problem (3D-BPP), where the bin he...
In this paper a two-dimensional non-oriented guillotine bin packing problem is studied when items ha...
A novel evolutionary approach for the bin packing problem (BPP) is presented. A simple steady-state ...
This paper considers a non-oriented twodimensional bin packing problem, where a set of small recta...
A bin packing (BP) problem is an industrial problem that arises when grouping items into appropriate...
Abstract. Problem statement: Cutting and packing (C and P) problems are optimization problems that a...