Worst-case analysis of heuristic approaches for the temporal bin packing problem with fire-ups
From MaRDI portal
Publication:6491686
DOI10.1007/S10479-023-05446-8MaRDI QIDQ6491686
Nico Strasdat, John Martinovic
Publication date: 24 April 2024
Published in: Annals of Operations Research (Search for Journal in Brave)
Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- Unnamed Item
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- Minimizing total busy time in parallel scheduling with application to optical networks
- On dynamic bin packing: An improved lower bound and resource augmentation analysis
- Bin packing with divisible item sizes
- Introduction to cutting and packing optimization. Problems, modeling approaches, solution methods
- A generalized bin packing problem for parcel delivery in last-mile logistics
- Decomposition and reformulation of integer linear programming problems. (Summary)
- 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
- Stabilized column generation for the temporal knapsack problem using dual-optimal inequalities
- Dynamic bin packing of unit fractions items
- 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
- Multi-period bin packing model and effective constructive heuristics for corridor-based logistics capacity planning
- Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints
- Dynamic Bin Packing
- Optimal Analysis of Best Fit Bin Packing
- The Temporal Knapsack Problem and Its Solution
- A combinatorial flow-based formulation for temporal bin packing problems
This page was built for publication: Worst-case analysis of heuristic approaches for the temporal bin packing problem with fire-ups
