A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems
From MaRDI portal
(Redirected from Publication:336709)
Recommendations
- A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
- Multiple-type, two-dimensional bin packing problems: Applications and algorithms
- A heuristic for solving large bin packing problems in two and three dimensions
- A 3-approximation algorithm for two-dimensional bin packing
- A greedy search for the three-dimensional bin packing problem: the packing static stability case
- GRASP and path relinking for the two-dimensional two-stage cutting-stock problem
- GRASP with path-relinking for the generalized quadratic assignment problem
- Models and algorithms for three-stage two-dimensional bin packing
Cites work
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 2050708 (Why is no real title available?)
- scientific article; zbMATH DE number 2119079 (Why is no real title available?)
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- A Linear Programming Approach to the Cutting-Stock Problem
- A general purpose algorithm for three-dimensional packing
- A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
- A hybrid heuristic for the \(p\)-median problem
- A probabilistic heuristic for a computationally difficult set covering problem
- Algorithms for packing and scheduling problems. (Abstract of thesis)
- Algorithms – ESA 2004
- An APTAS for Generalized Cost Variable-Sized Bin Packing
- An analytical model for the container loading problem
- An improved typology of cutting and packing problems
- Exact solution of the two-dimensional finite bin packing problem
- GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
- GRASP and path relinking for the max-min diversity problem
- GRASP for set packing problems.
- New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
- New bounds for multidimensional packing
- Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
- Scatter search. Methodology and implementation in C. With CD-ROM.
- Solving the variable size bin packing problem with discretized formulations
- The Three-Dimensional Bin Packing Problem
- The two-dimensional bin packing problem with variable bin sizes and costs
- Three-dimensional bin packing problem with variable bin height
- Two-Dimensional Finite Bin-Packing Algorithms
- Variable Sized Bin Packing
Cited in
(14)- Lower bounds for three-dimensional multiple-bin-size bin packing problems
- A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
- Determining the best shipper sizes for sending products to customers
- GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem
- A lookahead matheuristic for the unweighed variable-sized two-dimensional bin packing problem
- Sharing loading costs for multi compartment vehicles
- A hybrid estimation of distribution algorithm for the offline 2D variable-sized bin packing problem
- The exact solutions of several types of container loading problems
- The master bay plan problem: a solution method based on its connection to the three-dimensional bin packing problem
- The multiple container loading problem with preference
- Three-stage heuristic algorithm for three-dimensional irregular packing problem
- A hybrid heuristic algorithm for the 2D variable-sized bin packing problem
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers
- A goal-driven prototype column generation strategy for the multiple container loading cost minimization problem
This page was built for publication: A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336709)
