Solving the pallet loading problem (Q2384612)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Solving the pallet loading problem	scientific article

Statements

scholarly article

0 references

Solving the pallet loading problem (English)

0 references

Gustavo H. A. Martins

0 references

0 references

European Journal of Operational Research

0 references

publication date

10 October 2007

0 references

zbMATH Keywords

Packing

0 references

pallet loading

0 references

combinatorial optimization

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.ejor.2006.11.012

0 references

An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems

0 references

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

0 references

An Algorithm for Two-Dimensional Cutting Problems

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

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

0 references

An exact algorithm for the pallet loading problem

0 references

Multistage Cutting Stock Problems of Two and More Dimensions

0 references

Analysis of upper bounds for the pallet loading problem

0 references

An <i>L</i>-approach for packing (<i>ℓ</i>, <i>w</i>)-rectangles into rectangular and <i>L</i>-shaped pieces

0 references

The minimum size instance of a Pallet Loading Problem equivalence class

0 references

A simple and effective recursive procedure for the manufacturer's pallet loading problem

0 references

How to use structural constraints to compute an upper bound for the pallet loading problem

0 references

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

0 references

The G4-Heuristic for the Pallet Loading Problem

0 references

A Polynomial Time Algorithm For The Guillotine Pallet Loading Problem

0 references

Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems

0 references

A fast algorithm for two-dimensional pallet loading problems of large size

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/j.ejor.2006.11.012

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2384612

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