An improved typology of cutting and packing problems (Q2643945): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 13:52, 19 December 2024

scientific article

Language	Label	Description	Also known as
English	An improved typology of cutting and packing problems	scientific article

Statements

scholarly article

0 references

An improved typology of cutting and packing problems (English)

0 references

Gerhard Wäscher

0 references

0 references

Holger Schumann

0 references

European Journal of Operational Research

0 references

publication date

27 August 2007

0 references

zbMATH Keywords

cutting

0 references

packing

0 references

typology

0 references

describes a project that uses

0 references

0 references

0 references

MaRDI profile type

0 references

full work available at URL

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

0 references

3D random stacking of weakly heterogeneous palletization problems

0 references

Algorithms for on-line bin-packing problems with cardinality constraints

0 references

Bounds for Two-Dimensional Cutting

0 references

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

0 references

Algorithms for Unconstrained Two-Dimensional Guillotine Cutting

0 references

A population heuristic for constrained two-dimensional non-guillotine cutting

0 references

A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths

0 references

An algorithm for a cutting stock problem on a strip

0 references

Optimizing the packing of cylinders into a rectangular container: A nonlinear approach

0 references

A comparative evaluation of heuristics for container loading

0 references

Loading Multiple Pallets

0 references

Loading plates with non-identical items

0 references

0 references

A heuristic for multiple container loading problems

0 references

A tabu search algorithm for weakly heterogeneous container loading problems

0 references

A hybrid genetic algorithm for the container loading problem

0 references

0 references

On the two-dimensional knapsack problem

0 references

Solution procedures for cutting lumber into furniture parts

0 references

Solving nesting problems with non-convex polygons by constraint logic programming

0 references

An analytical model for the container loading problem

0 references

An exact algorithm for general, orthogonal, two-dimensional knapsack problems

0 references

An Algorithm for Two-Dimensional Cutting Problems

0 references

Variable-Sized Bin Packing: Tight Absolute Worst-Case Performance Ratios for Four Approximation Algorithms

0 references

0 references

Cylinder packing by simulated annealing

0 references

A New Upper Bound for the Cylinder Packing Problem

0 references

Binary knapsack problems with random budgets

0 references

An exact algorithm for the pallet loading problem

0 references

A simulated annealing approach to the multiconstraint zero-one knapsack problem

0 references

A New Linear Programming Approach to the Cutting Stock Problem

0 references

A typology of cutting and packing problems

0 references

A bottleneck assignment approach to the multiple container loading problem

0 references

Guided Local Search for the Three-Dimensional Bin-Packing Problem

0 references

A new exact algorithm for general orthogonal d-dimensional knapsack problems

0 references

Simulated annealing for order spread minimization in sequencing cutting patterns

0 references

Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality

0 references

A Method for Solving Container Packing for a Single Size of Box

0 references

Packing different-sized circles into a rectangular container

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

A sequential heuristic procedure for one-dimensional cutting

0 references

Evaluation of algorithms for one-dimensional cutting

0 references

A Multistage Solution of the Template-Layout Problem

0 references

A Local Optimization-based Solution to the Rectangle Layout Problem

0 references

On-line packing with boxes of different sizes

0 references

Recursive Computational Procedure for Two-dimensional Stock Cutting

0 references

Exact algorithms for unconstrained three-dimensional cutting problems: A comparative study

0 references

Approximate algorithms for constrained circular cutting problems

0 references

An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem

0 references

A review of the application of meta-heuristic algorithms to 2D strip packing problems

0 references

Heuristiken zur Lösung des zweidimensionalen Packproblems für Rundgefäße. (Heuristics for the solution of the two-dimensional packing problem for cylinders)

0 references

On genetic algorithms for the packing of polygons

0 references

Algorithms for the variable sized bin packing problem

0 references

On fuzzy random linear knapsack problems

0 references

Cutting optimization with variable-sized stock and inventory status data

0 references

Guillotineable bin packing: A genetic approach

0 references

Upper bounds and algorithms for the maximum cardinality bin packing problem.

0 references

Compaction and separation algorithms for non-convex polygons and their applications

0 references

An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container

0 references

Approximation algorithm for the oriented two-dimensional bin packing problem

0 references

Two-dimensional packing problems: a survey

0 references

Recent advances on two-dimensional bin packing problems

0 references

Heuristic algorithms for the three-dimensional bin packing problem

0 references

Models and bounds for two-dimensional level packing problems

0 references

0 references

Exact Solution of the Two-Dimensional Finite Bin Packing Problem

0 references

New trends in exact algorithms for the \(0-1\) knapsack problem

0 references

An Exact Approach to the Strip-Packing Problem

0 references

An algorithm for the three-dimensional packing problem with asymptotic performance analysis

0 references

0 references

Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach

0 references

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

0 references

A combined cutting-stock and lot-sizing problem

0 references

Applied simulated annealing

0 references

TOPOS -- A new constructive algorithm for nesting problems

0 references

An exact algorithm for large multiple knapsack problems

0 references

Heuristics for the container loading problem

0 references

Allowing for weight considerations in container loading

0 references

The solution of two-stage guillotine cutting stock problems having extremely varying order demands

0 references

0 references

4-block heuristic for the rectangle packing problem

0 references

The growth of m-constraint random knapsacks

0 references

BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem

0 references

The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP

0 references

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

0 references

A method of optimal lattice packing of congruent oriented polygons in the plane

0 references

Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints

0 references

An efficient approach for the multi-pallet loading problem

0 references

Some Experiences On Solving Multiconstraint Zero-One Knapsack Problems With Genetic Algorithms

0 references

Solving binary cutting stock problems by column generation and branch- and-bound

0 references

Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem

0 references

A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem

0 references

Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems

0 references

An LP-based approach to cutting stock problems with multiple objectives

0 references

Heuristics for the integer one-dimensional cutting stock problem: A computational study

0 references

On a pattern sequencing problem to minimize the maximum number of open stacks

0 references

Improved heuristics for sequencing cutting patterns

0 references

Establishing the optimality of sequencing heuristics for cutting stock problems

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

10.1016/J.EJOR.2005.12.047

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2643945

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