An open source architecture for the interactive solution of packing problems in two dimensions is presented. Although primarily developed for helping engineering students to understand the algorithmic approaches to the solution of difficult combinatorial optimization problems, the application can be useful to practitioners and developers thanks to its visual tools. The paper gives intuitive and formal definitions of the problems at hand, discusses two natural heuristic approaches, provides technical information on the application, and reports the results of classroom experimental testings
SIGLEAvailable from British Library Document Supply Centre-DSC:DX212062 / BLDSC - British Library Do...
Abstract. A hybrid heuristic algorithm for the two-dimensional rectangular packing problem is presen...
Packing problems on its current state are being utilized for wide area of industrial applications. T...
An open source architecture for the interactive solution of packing problems in two dimensions is pr...
Two-dimensional cutting and packing problems model a large number of relevant industrial application...
This volume presents a selection of case studies that address a substantial range of optimized objec...
The three-dimensional knapsack problem aims to find the combination of given rectangles or boxes int...
We propose two exact algorithms for two-dimensional orthogonal packing problems whose main component...
We survey the main result presented in the author\u2019s Ph.D Thesis (Monaci 2001), discussed on Jan...
The article is devoted to the development and research of algorithms for placing objects of complex ...
The thesis first addresses the typology of cutting problems and their relationship to the packing pr...
This thesis investigates two major classes of Evolutionary Algorithms, Genetic Algorithms (GAs) and ...
The automatic packing of irregular shapes in a two-dimensional space rises a complex problem of geom...
Cutting and packing problems are combinatorial optimisation problems. In most manufacturing situatio...
This paper develops a hybrid demon algorithm for a two-dimensional orthogonal strip packing problem....
SIGLEAvailable from British Library Document Supply Centre-DSC:DX212062 / BLDSC - British Library Do...
Abstract. A hybrid heuristic algorithm for the two-dimensional rectangular packing problem is presen...
Packing problems on its current state are being utilized for wide area of industrial applications. T...
An open source architecture for the interactive solution of packing problems in two dimensions is pr...
Two-dimensional cutting and packing problems model a large number of relevant industrial application...
This volume presents a selection of case studies that address a substantial range of optimized objec...
The three-dimensional knapsack problem aims to find the combination of given rectangles or boxes int...
We propose two exact algorithms for two-dimensional orthogonal packing problems whose main component...
We survey the main result presented in the author\u2019s Ph.D Thesis (Monaci 2001), discussed on Jan...
The article is devoted to the development and research of algorithms for placing objects of complex ...
The thesis first addresses the typology of cutting problems and their relationship to the packing pr...
This thesis investigates two major classes of Evolutionary Algorithms, Genetic Algorithms (GAs) and ...
The automatic packing of irregular shapes in a two-dimensional space rises a complex problem of geom...
Cutting and packing problems are combinatorial optimisation problems. In most manufacturing situatio...
This paper develops a hybrid demon algorithm for a two-dimensional orthogonal strip packing problem....
SIGLEAvailable from British Library Document Supply Centre-DSC:DX212062 / BLDSC - British Library Do...
Abstract. A hybrid heuristic algorithm for the two-dimensional rectangular packing problem is presen...
Packing problems on its current state are being utilized for wide area of industrial applications. T...