Exact algorithms for the two-dimensional strip packing problem with and without rotations
From MaRDI portal
Publication:1027586
DOI10.1016/J.EJOR.2008.08.020zbMATH Open1163.90803OpenAlexW1973019085MaRDI QIDQ1027586FDOQ1027586
Authors: Mitsutoshi Kenmochi, Takashi Imamichi, Koji Nonobe, Mutsunori Yagiura, Hiroshi Nagamochi 
Publication date: 30 June 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2008.08.020
Recommendations
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Cites Work
- Exact algorithms for the two-dimensional strip packing problem with and without rotations
- On genetic algorithms for the packing of polygons
- An improved typology of cutting and packing problems
- Title not available (Why is that?)
- Two-dimensional packing problems: a survey
- Orthogonal Packings in Two Dimensions
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
- A new heuristic recursive algorithm for the strip rectangular packing problem
- An exact approach to the strip-packing problem
- Handbook of Approximation Algorithms and Metaheuristics
- Title not available (Why is that?)
- The Three-Dimensional Bin Packing Problem
- A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
- Some experiments with simulated annealing techniques for packing problems
- An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles
- The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
- Reactive GRASP for the strip-packing problem
- A least wasted first heuristic algorithm for the rectangular packing problem
- Exhaustive approaches to 2D rectangular perfect packings
- An Improved Heuristic Recursive Strategy Based on Genetic Algorithm for the Strip Rectangular Packing Problem
- Local search algorithms for the rectangle packing problem with general spatial costs
- A review of the application of meta-heuristic algorithms to 2D strip packing problems
- Improved local search algorithms for the rectangle packing problem with general spatial costs
- New heuristic and interactive approaches to 2D rectangular strip packing
Cited In (38)
- Compact integer linear programming formulations for the temporal bin packing problem with fire-ups
- Bidirectional best-fit heuristic for orthogonal rectangular strip packing
- Irregular packing: MILP model based on a polygonal enclosure
- Exact solution techniques for two-dimensional cutting and packing
- Exhaustive approaches to 2D rectangular perfect packings
- Routing problems with loading constraints
- An open space based heuristic for the 2D strip packing problem with unloading constraints
- Logic based Benders' decomposition for orthogonal stock cutting problems
- Exact algorithms for the two-dimensional strip packing problem with and without rotations
- New lower bounds for bin packing problems with conflicts
- A SAT-based method for solving the two-dimensional strip packing problem
- A skyline heuristic for the 2D rectangular packing and strip packing problems
- A hybrid algorithm based on variable neighbourhood for the strip packing problem
- A simple randomized algorithm for two-dimensional strip packing
- Metaheuristics for truck loading in the car production industry
- A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem
- An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation
- Upper bounds for heuristic approaches to the strip packing problem
- LP bounds in various constraint programming approaches for orthogonal packing
- Combinatorial Benders' cuts for the strip packing problem
- A new search procedure for the two-dimensional orthogonal packing problem
- Scheduling inspired models for two-dimensional packing problems
- The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview
- A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint
- An exact strip packing algorithm based on canonical forms
- A squeaky wheel optimisation methodology for two-dimensional strip packing
- A hybrid demon algorithm for the two-dimensional orthogonal strip packing problem
- A reference length approach for the 3D strip packing problem
- Exact and approximate methods for the score-constrained packing problem
- A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem
- Constructive heuristics for the canister filling problem
- Corner occupying theorem for the two-dimensional integral rectangle packing problem
- An exact algorithm for the two-dimensional strip-packing problem
- Order and static stability into the strip packing problem
- The Meet-in-the-Middle Principle for Cutting and Packing Problems
- A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem
- An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem
- On packing squares into a rectangle
This page was built for publication: Exact algorithms for the two-dimensional strip packing problem with and without rotations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1027586)
