A hybrid algorithm for constrained order packing
From MaRDI portal
Publication:301159
DOI10.1007/s10100-012-0282-3zbMath1339.90281OpenAlexW2090013189MaRDI QIDQ301159
Nikolaus Furian, Siegfried Vössner
Publication date: 29 June 2016
Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10100-012-0282-3
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Traffic problems in operations research (90B20)
Related Items (1)
Uses Software
Cites Work
- A note on two problems in connexion with graphs
- A heuristic for solving large bin packing problems in two and three dimensions
- Constrained order packing: comparison of heuristic approaches for a new bin packing problem
- Routing problems with loading constraints
- A generic approach for nesting of 2-D parts in 2-D sheets using genetic and heuristic algorithms
- TSpack: A unified tabu search code for multi-dimensional bin packing problems
- A general framework for bounds for higher-dimensional orthogonal packing problems.
- Strip packing with precedence constraints and strip packing with release times
- New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation
- Two-dimensional packing with conflicts
- The one-dimensional cutting stock problem with due dates
- Modified subset sum heuristics for bin packing
- A lower bound for the non-oriented two-dimensional bin packing problem
- A new model for complete solutions to one-dimensional cutting stock problems.
- Worst-case analysis of the subset sum algorithm for bin packing.
- The two-dimensional finite bin packing problem. I: New lower bounds for the oriented case
- The two-dimensional finite bin packing problem. II: New lower and upper bounds
- Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts
- Approximation algorithm for the oriented two-dimensional bin packing problem
- A 2-exchange heuristic for nesting problems
- A new lower bound for the non-oriented two-dimensional bin-packing problem
- Heuristic shortest path algorithms for transportation applications: state of the art
- An improved typology of cutting and packing problems
- A two-dimensional strip cutting problem with sequencing constraint
- Exact Solution of the Two-Dimensional Finite Bin Packing Problem
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- Effective nesting of rectangular parts in multiple rectangular sheets using genetic and heuristic algorithms
This page was built for publication: A hybrid algorithm for constrained order packing
