Orthogonal Packings in Two Dimensions
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Exact algorithms for the two-dimensional strip packing problem with and without rotations
- A note on online strip packing
- Metaheuristics for vehicle routing problems with three-dimensional loading constraints
- Packing solar cells on a roof
- Bubblesearch: a simple heuristic for improving priority-based greedy algorithms
- New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
- Expected performance of the shelf heuristic for 2-dimensional packing
- A 2.5 times optimal algorithm for packing in two dimensions
- An improved BL lower bound
- Probabilistic analysis for simple one- and two-dimensional bin packing algorithms
- Oriented aligned rectangle packing problem
- Knowledge based approach to the cutting stock problem
- Packing problems
- On genetic algorithms for the packing of polygons
- An algorithm for the 2D guillotine cutting stock problem
- Multiple-type, two-dimensional bin packing problems: Applications and algorithms
- An approximation scheme for strip packing of rectangles with bounded dimensions
- Simulated annealing for manufacturing systems layout design
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems
- Exact algorithms for the guillotine strip cutting/packing problem.
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- Scheduling space-sharing for internet advertising
- 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
- A hybrid demon algorithm for the two-dimensional orthogonal strip packing problem
- iGreen: green scheduling for peak demand minimization
- Dealing with nonregular shapes packing
- New upper bounds for online strip packing
- A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint
- An efficient deterministic heuristic for two-dimensional rectangular packing
- The two-dimensional cutting stock problem revisited
- Average-case performance analysis of a 2D strip packing algorithm -- NFDH
- An algorithm for polygon placement using a bottom-left strategy
- Two-dimensional packing problems: a survey
- Two-dimensional packing algorithms for layout of disconnected graphs
- A mathematical model and a solution method for the problem of placing various-sized circles into a strip
- The nesting problem in the leather manufacturing industry
- Efficient heuristics for robot acquisition planning for a CIM system
- A reference length approach for the 3D strip packing problem
- Space defragmentation for packing problems
- A multi-objective genetic algorithm for a special type of 2D orthogonal packing problems
- A parallel biased random-key genetic algorithm with multiple populations applied to irregular strip packing problems
- Spatial scheduling optimization algorithm for block assembly in shipbuilding
- A new upper bound for the online square packing problem in a strip
- Vehicle routing problems with loading constraints: state-of-the-art and future directions
- Exact solution techniques for two-dimensional cutting and packing
- Two-bar charts packing problem
- A hybrid metaheuristic for the two-dimensional strip packing problem
- The variable-width strip packing problem
- Effective loading in combined vehicle routing and container loading problems
- A computational study of constraint programming approaches for resource-constrained project scheduling with autonomous learning effects
- On online algorithms for bin, strip, and box packing, and their worst-case and average-case analysis
- Bidirectional best-fit heuristic for orthogonal rectangular strip packing
- Malleable scheduling for flows of jobs and applications to MapReduce
- An open space based heuristic for the 2D strip packing problem with unloading constraints
- An efficient heuristic algorithm for two-dimensional rectangular packing problem with central rectangle
- Improved lower bound for online strip packing
- A guided tabu search for the vehicle routing problem with two-dimensional loading constraints
- Exhaustive approaches to 2D rectangular perfect packings
- A tight analysis of Brown-Baker-Katseff sequences for online strip packing
- Exact and approximate methods for parallel multiple-area spatial scheduling with release times
- Approximation and online algorithms for multidimensional bin packing: a survey
- A hybrid genetic algorithm with a new packing strategy for the three-dimensional bin packing problem
- A 3-approximation algorithm for two-dimensional bin packing
- A \(\frac 54\)-approximation algorithm for scheduling identical malleable tasks
- A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
- A new exact method for the two-dimensional orthogonal packing problem
- The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview
- An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem
- Upper bounds for heuristic approaches to the strip packing problem
- An improved best-fit heuristic for the orthogonal strip packing problem
- Shelf algorithms for on-line strip packing
- A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints
- Coordination mechanisms for selfish parallel jobs scheduling (extended abstract)
- A hybrid evolutionary algorithm for the two-dimensional packing problem
- Online Square Packing
- Two for One: Tight Approximation of 2D Bin Packing
- Approximation Algorithms for Maximizing the Number of Squares Packed into a Rectangle
- A new lower bound for online strip packing
- Polynomial-time approximation schemes for circle and other packing problems
- An effective shaking procedure for 2D and 3D strip packing problems
- Efficient implementations of construction heuristics for the rectilinear block packing problem
- An effective tabu search approach with improved loading algorithms for the 3L-CVRP
- A simple randomized algorithm for two-dimensional strip packing
- An exact strip packing algorithm based on canonical forms
- Models and algorithms for packing rectangles into the smallest square
- Adjacent-Resource Scheduling
- Corner occupying theorem for the two-dimensional integral rectangle packing problem
- Efficiency of two classes of dynamic scheduling algorithms in multiprocessor computer systems
- A (5/3+)-approximation for strip packing
- On Packing Two-Dimensional Bins
- A skyline heuristic for the 2D rectangular packing and strip packing problems
- An effective approximation algorithm for the malleable parallel task scheduling problem
- Asymptotically optimal scheduling of random malleable demands in smart grid
- Packing, covering and tiling in two-dimensional spaces
- Online square packing with gravity
- On-line bin packing ? A restricted survey
- Online strip packing with polynomial migration
- A posteriori analysis of the algorithms for two-bar charts packing problem
- On two dimensional packing
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)
