Exact and approximate methods for a one-dimensional minimax bin-packing problem

DOI10.1007/s10479-012-1175-5zbMath1271.90068OpenAlexW1976567265MaRDI QIDQ363606

Hans-Friedrich Köhn, Michael J. Brusco, Douglas Steinley

Publication date: 3 September 2013

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-012-1175-5

zbMATH Keywords

integer programmingcombinatorial optimizationsimulated annealingone-dimensional bin-packingtest splitting

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Uses Software

• CPLEX
• XPRESS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Bin packing problems in one dimension: Heuristic solutions and confidence intervals
• Using aptitude measurements for the optimal assignment of subjects to treatments with and without mastery scores
• Bin-packing by simulated annealing
• On the Sum-of-Squares algorithm for bin packing
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
• Worst-Case Analysis of Heuristics for the Bin Packing Problem with General Cost Structures
• A morph-based simulated annealing heuristic for a modified bin-packing problem
• Optimal Scheduling of Tasks on Identical Parallel Processors
• Cluster Analysis and Mathematical Programming
• Linear Models for Optimal Test Design
• New heuristics for one-dimensional bin-packing

This page was built for publication: Exact and approximate methods for a one-dimensional minimax bin-packing problem