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

DOI10.1007/S10479-012-1175-5MaRDI QIDQ363606zbMATH OpenOpenAlexFDO

Authors Michael J. Brusco, Hans-Friedrich Köhn, 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

combinatorial optimizationinteger programmingone-dimensional bin-packingsimulated annealingtest splitting

Mathematics Subject Classification ID

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

Recommendations

• Bin packing problems in one dimension: Heuristic solutions and confidence intervals
• BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
• Solving the one-dimensional bin packing problem with a weight annealing heuristic
• Bin-packing by simulated annealing
• On a dual version of the one-dimensional bin packing problem

Cites work

• A morph-based simulated annealing heuristic for a modified bin-packing problem
• Bin packing problems in one dimension: Heuristic solutions and confidence intervals
• Bin-packing by simulated annealing
• Cluster Analysis and Mathematical Programming
• scientific article; zbMATH DE number 4133847 (Why is no real title available?)
• scientific article; zbMATH DE number 2144387 (Why is no real title available?)
• scientific article; zbMATH DE number 2231543 (Why is no real title available?)
• scientific article; zbMATH DE number 4189544 (Why is no real title available?)
• Linear Models for Optimal Test Design
• New heuristics for one-dimensional bin-packing
• On the Sum-of-Squares algorithm for bin packing
• Optimal Scheduling of Tasks on Identical Parallel Processors
• Optimization by simulated annealing
• Using aptitude measurements for the optimal assignment of subjects to treatments with and without mastery scores
• Worst-Case Analysis of Heuristics for the Bin Packing Problem with General Cost Structures
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms

Cited in

(4)

• On a dual version of the one-dimensional bin packing problem
• scientific article; zbMATH DE number 3950202 (Why is no real title available?)
• A Study of Bi-space Search for Solving the One-Dimensional Bin Packing Problem
• Integer programming in psychology: a review and directions for future research

Describes a project that uses

Uses Software

• CPLEX
• XPRESS

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q363606)