Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups

DOI10.1007/s11590-021-01825-xzbMath1503.90118OpenAlexW4200474271MaRDI QIDQ2080827

John Martinovic, Nico Strasdat, Fabio Furini, José M. Valério de Carvalho

Publication date: 11 October 2022

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-021-01825-x

zbMATH Keywords

integer linear programmingcutting and packingfire-upstemporal bin packing problem

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Related Items

Lower and upper bounding procedures for the bin packing problem with concave loading cost, A combinatorial flow-based formulation for temporal bin packing problems

Cites Work

• Bin packing and cutting stock problems: mathematical models and exact algorithms
• Scheduling jobs with fixed start and end times
• A branch-and-bound algorithm for the two-dimensional vector packing problem
• Introduction to cutting and packing optimization. Problems, modeling approaches, solution methods
• LP models for bin packing and cutting stock problems
• Exact solution techniques for two-dimensional cutting and packing
• An iterative dynamic programming approach for the temporal knapsack problem
• 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
• Mathematical Methods of Organizing and Planning Production
• An Exact Approach to the Strip-Packing Problem
• Uncapacitated Lot-Sizing Problems with Start-Up Costs
• The Temporal Knapsack Problem and Its Solution
• Lower bounds and algorithms for the 2-dimensional vector packing problem
• Solving the temporal knapsack problem via recursive Dantzig-Wolfe reformulation