Packing problems (Q1197916)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Packing problems	scientific article

Statements

scholarly article

0 references

Packing problems (English)

0 references

zbMATH Open document ID

0 references

10.1016/0377-2217(92)90288-K

0 references

Kathryn A. Dowsland

0 references

William B. Dowsland

0 references

European Journal of Operational Research

0 references

publication date

16 January 1993

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

MaRDI profile type

MaRDI publication profile

0 references

A Solution of the Rectangular Cutting-Stock Problem

0 references

Orthogonal Packings in Two Dimensions

0 references

A Tight Asymptotic Bound for Next-Fit-Decreasing Bin-Packing

0 references

Approximation Algorithms for Maximizing the Number of Squares Packed into a Rectangle

0 references

Shelf Algorithms for Two-Dimensional Packing Problems

0 references

Packing the maximum number of \(m\times n\) tiles in a large \(p\times q\) rectangle

0 references

Expected performance of the shelf heuristic for 2-dimensional packing

0 references

An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure

0 references

Bounds for Two-Dimensional Cutting

0 references

Algorithms for Unconstrained Two-Dimensional Guillotine Cutting

0 references

Network flows and non-guillotine cutting patterns

0 references

Three-dimensional packing of items with limited load bearing strength

0 references

A comparative evaluation of heuristics for container loading

0 references

The dissection of rectangles into squares

0 references

An improved BL lower bound

0 references

Practical Considerations of the Pallet-Loading Problem

0 references

An Algorithm for Two-Dimensional Cutting Problems

0 references

0 references

On Packing Two-Dimensional Bins

0 references

Bin packing: Maximizing the number of pieces packed

0 references

0 references

Dynamic, first-fit packings in two or more dimensions

0 references

Asymptotic Methods in the Probabilistic Analysis of Sequencing and Packing Heuristics

0 references

Algorithms for Packing Squares: A Probabilistic Analysis

0 references

Average-case analysis of cutting and packing in two dimensions

0 references

0 references

Knowledge-based systems for cutting stock problems

0 references

An Improved Algorithm for the Non-Guillotine-Constrained Cutting-Stock Problem

0 references

A Note on the Two-Dimensional Rectangular Cutting-Stock Problem

0 references

Nonorthogonal Two-Dimensional Cutting Patterns

0 references

The Three-Dimensional Pallet Chart: An Analysis of the Factors Affecting the Set of Feasible Layouts for a Class of Two-Dimensional Packing Problems

0 references

Determining an upper bound for a class of rectangular packing problems

0 references

An exact algorithm for the pallet loading problem

0 references

A Combined Data-Base and Algorithmic Approach to the Pallet-Loading Problem

0 references

Efficient automated pallet loading

0 references

The computer as an aid to physical distribution management

0 references

0 references

A typology of cutting and packing problems

0 references

The Loading Problem

0 references

Optimal packing and covering in the plane are NP-complete

0 references

Determining the minimum-area encasing rectangle for an arbitrary closed curve

0 references

Variable Sized Bin Packing

0 references

A computer-based heuristic for packing pooled shipment containers

0 references

A Linear Programming Approach to the Cutting-Stock Problem

0 references

A Linear Programming Approach to the Cutting Stock Problem—Part II

0 references

Multistage Cutting Stock Problems of Two and More Dimensions

0 references

The Theory and Computation of Knapsack Functions

0 references

Performance Bounds for Orthogonal Oriented Two-Dimensional Packing Algorithms

0 references

Tiling with polyominoes

0 references

0 references

Technical Note—A Note on Computational Modifications to the Gilmore-Gomory Cutting Stock Algorithm

0 references

Load planning for shipments of low density products

0 references

A Multistage Solution of the Template-Layout Problem

0 references

A heuristic approach to the three-dimensional cargo-loading problem

0 references

Recursive Computational Procedure for Two-dimensional Stock Cutting

0 references

The trim-loss and assortment problems: A survey

0 references

Two-dimensional packing: expected performance of simple level algorithms

0 references

Performance testing of rectangular parts-nesting heuristics

0 references

Mathematical Methods of Organizing and Planning Production

0 references

0 references

0 references

A Search Model for Evaluating Combinatorially Explosive Problems

0 references

0 references

An improved version of Wang's algorithm for two-dimensional cutting problems

0 references

Generating Pallet Loading Patterns: A Special Case of the Two-Dimensional Cutting Stock Problem

0 references

Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography

0 references

Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems

0 references

full work available at URL

https://doi.org/10.1016/0377-2217(92)90288-k

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1197916

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1197916&oldid=37100546"