scientific article; zbMATH DE number 4133847

MaRDI QIDQ3035155zbMATH OpenFDO

Authors Thomas Kämpke

Publication date 1988

zbMATH Keywords

bin packingcooling strategiesMonte Carlo techniqueSimulated annealing

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

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

Cited in

(8)

• Packing problems
• Applying tabu search with influential diversification to multiprocessor scheduling
• An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
• Solving the one-dimensional bin packing problem with a weight annealing heuristic
• Bin packing and cutting stock problems: mathematical models and exact algorithms
• Exact and approximate methods for a one-dimensional minimax bin-packing problem
• A morph-based simulated annealing heuristic for a modified bin-packing problem
• Packaging optimization using the dynamic vector fields method

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)