scientific article; zbMATH DE number 4133847
From MaRDI portal
Publication:3035155
zbMATH Open0692.90086MaRDI QIDQ3035155FDOQ3035155
Authors: Thomas Kämpke 
Publication date: 1988
Title of this publication is not available (Why is that?)
Recommendations
- Bin-packing by simulated annealing
- A simulated annealing heuristic for the one-dimensional cutting stock problem
- Solving the one-dimensional bin packing problem with a weight annealing heuristic
- A morph-based simulated annealing heuristic for a modified bin-packing problem
- scientific article; zbMATH DE number 4211814
Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)
Cited In (8)
- Solving the one-dimensional bin packing problem with a weight annealing heuristic
- Packaging optimization using the dynamic vector fields method
- Applying tabu search with influential diversification to multiprocessor scheduling
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- A morph-based simulated annealing heuristic for a modified bin-packing problem
- Packing problems
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- Exact and approximate methods for a one-dimensional minimax bin-packing problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3035155)
