Orthogonal Packings in Two Dimensions
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Closing the Gap for Pseudo-Polynomial Strip Packing
- Bidirectional best-fit heuristic for orthogonal rectangular strip packing
- New upper bounds for online strip packing
- Exact solution techniques for two-dimensional cutting and packing
- Exhaustive approaches to 2D rectangular perfect packings
- A fast implementation for the 2D/3D box placement problem
- A parallel biased random-key genetic algorithm with multiple populations applied to irregular strip packing problems
- An algorithm for polygon placement using a bottom-left strategy
- Spatial scheduling optimization algorithm for block assembly in shipbuilding
- Routing problems with loading constraints
- A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints
- An open space based heuristic for the 2D strip packing problem with unloading constraints
- Human-guided search
- An introduction to the two‐dimensional rectangular cutting and packing problem
- Online strip packing with modifiable boxes
- A tight \((3/2+\varepsilon)\)-approximation for skewed strip packing
- A Tight (3/2+ε) Approximation for Skewed Strip Packing.
- A (5/3+)-approximation for strip packing
- Two-dimensional packing algorithms for layout of disconnected graphs
- A computational study of constraint programming approaches for resource-constrained project scheduling with autonomous learning effects
- Adjacent-Resource Scheduling
- Exact algorithms for the two-dimensional strip packing problem with and without rotations
- Bubblesearch: a simple heuristic for improving priority-based greedy algorithms
- An efficient heuristic algorithm for two-dimensional rectangular packing problem with central rectangle
- Metaheuristics for vehicle routing problems with three-dimensional loading constraints
- Improved sequential insertion heuristics for berth allocation problems
- An improved approximation for packing big two-bar charts
- A posteriori analysis of the algorithms for two-bar charts packing problem
- An improved BL lower bound
- Online Square Packing
- A new upper bound for the online square packing problem in a strip
- Resource sharing combined with layout effects in high-level synthesis
- On genetic algorithms for the packing of polygons
- Fuzzy bin packing problem.
- Shelf algorithms for on-line strip packing
- Simulated annealing for manufacturing systems layout design
- An effective approximation algorithm for the malleable parallel task scheduling problem
- A hybrid genetic algorithm with a new packing strategy for the three-dimensional bin packing problem
- Solution validator and visualizer for (combined) vehicle routing and container loading problems
- A skyline heuristic for the 2D rectangular packing and strip packing problems
- A hybrid evolutionary algorithm for the two-dimensional packing problem
- The bottom-left algorithm for the strip packing problem
- A simple randomized algorithm for two-dimensional strip packing
- Recent advances on two-dimensional bin packing problems
- The variable-width strip packing problem
- The nesting problem in the leather manufacturing industry
- Effective loading in combined vehicle routing and container loading problems
- An algorithm for the 2D guillotine cutting stock problem
- Approximation and online algorithms for multidimensional bin packing: a survey
- Efficient heuristics for robot acquisition planning for a CIM system
- A hybrid placement strategy for the three-dimensional strip packing problem
- Expected performance of the shelf heuristic for 2-dimensional packing
- Peak demand minimization via sliced strip packing
- New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation
- Probabilistic analysis for simple one- and two-dimensional bin packing algorithms
- Average-case performance analysis of a 2D strip packing algorithm -- NFDH
- An improved skyline based heuristic for the 2D strip packing problem and its efficient implementation
- An iterative merging algorithm for soft rectangle packing and its extension for application of fixed-outline floorplanning of soft modules
- New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
- Rectangle packing with a recursive pilot method
- A tetris beam search algorithm for the distributor's pallet loading problem
- Improved approximation algorithms for 2-dimensional knapsack: packing into multiple l-shapes, spirals, and more
- Strip packing with precedence constraints and strip packing with release times
- Two for one: tight approximation of 2D bin packing
- An improved approximation algorithm for scheduling monotonic moldable tasks
- A new lower bound for online strip packing
- On-line bin packing ? A restricted survey
- Polynomial-time approximation schemes for circle and other packing problems
- Upper bounds for heuristic approaches to the strip packing problem
- An effective tabu search approach with improved loading algorithms for the 3L-CVRP
- A guided tabu search for the vehicle routing problem with two-dimensional loading constraints
- Reactive GRASP for the strip-packing problem
- On online algorithms for bin, strip, and box packing, and their worst-case and average-case analysis
- Two-bar charts packing problem
- Packing, covering and tiling in two-dimensional spaces
- Improved upper bounds for online malleable job scheduling
- Exact algorithms for the guillotine strip cutting/packing problem.
- An effective shaking procedure for 2D and 3D strip packing problems
- Efficient implementations of construction heuristics for the rectilinear block packing problem
- Packing problems
- Online multiple-strip packing
- Approximate algorithms to pack rectangles into several strips
- A 3-approximation algorithm for two-dimensional bin packing
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- Approximation Algorithms for Maximizing the Number of Squares Packed into a Rectangle
- Two-dimensional packing problems: a survey
- Online square packing with gravity
- An approximation scheme for strip packing of rectangles with bounded dimensions
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems
- Coordination mechanisms for selfish parallel jobs scheduling (extended abstract)
- The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview
- On-line scheduling of parallel jobs in a list
- An exact strip packing algorithm based on canonical forms
- A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint
- Scheduling parallel jobs to minimize the makespan
- Asymptotically optimal scheduling of random malleable demands in smart grid
- iGreen: green scheduling for peak demand minimization
- A squeaky wheel optimisation methodology for two-dimensional strip packing
- Models and algorithms for packing rectangles into the smallest square
- Dynamic storage allocation with known durations
This page was built for publication: Orthogonal Packings in Two Dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3893334)
