A heuristic-based reduction for the temporal bin packing problem with fire-ups

DOI10.1007/978-3-031-08623-6_20MaRDI QIDQ6606648

Nico Strasdat, John Martinovic

Publication date: 17 September 2024

zbMATH Keywords

heuristicsreductioncutting and packingfire-upstemporal bin packing

Mathematics Subject Classification ID

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

Cites Work

• Bin packing and cutting stock problems: mathematical models and exact algorithms
• Introduction to cutting and packing optimization. Problems, modeling approaches, solution methods
• An iterative dynamic programming approach for the temporal knapsack problem
• Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups
• A branch-and-price algorithm for the temporal bin packing problem
• Multi-objective temporal bin packing problem: an application in cloud computing
• Compact integer linear programming formulations for the temporal bin packing problem with fire-ups

This page was built for publication: A heuristic-based reduction for the temporal bin packing problem with fire-ups