Improved local search algorithms for the rectangle packing problem with general spatial costs
From MaRDI portal
Publication:2484340
Recommendations
- Local search algorithms for the rectangle packing problem with general spatial costs
- The rectangular packing problem: local optimum search methods based on block structures
- Oriented aligned rectangle packing problem
- scientific article; zbMATH DE number 4091172
- A NEW HEURISTIC ALGORITHM FOR CONSTRAINED RECTANGLE-PACKING PROBLEM
Cites work
- scientific article; zbMATH DE number 177832 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2050711 (Why is no real title available?)
- An effective quasi-human based heuristic for solving the rectangle packing problem
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles
- Formulation and tabu search algorithm for the resource constrained project scheduling problem.
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- Local search algorithms for the rectangle packing problem with general spatial costs
- Multistage Cutting Stock Problems of Two and More Dimensions
- Packing problems
- Packing problems and project scheduling models: an integrating perspective
- The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
- Two-dimensional packing problems: a survey
Cited in
(15)- Bidirectional best-fit heuristic for orthogonal rectangular strip packing
- A Local Optimization-based Solution to the Rectangle Layout Problem
- The rectangular packing problem: local optimum search methods based on block structures
- Optimizing yard assignment in an automotive transshipment terminal
- Exact algorithms for the two-dimensional strip packing problem with and without rotations
- Space and time allocation in a shipyard assembly hall
- An exact strip packing algorithm based on canonical forms
- The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio
- An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles
- A personal perspective on problem solving by general purpose solvers
- Packing squares independently
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers
- Handling precedence constraints in scheduling problems by the sequence pair representation
- Local search algorithms for the rectangle packing problem with general spatial costs
- Dynamic reduction heuristics for the rectangle packing area minimization problem
This page was built for publication: Improved local search algorithms for the rectangle packing problem with general spatial costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2484340)