Compact integer linear programming formulations for the temporal bin packing problem with fire-ups
From MaRDI portal
Publication:2668727
DOI10.1016/j.cor.2021.105288OpenAlexW3139099132MaRDI QIDQ2668727
John Martinovic, Nico Strasdat, M. Selch
Publication date: 7 March 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2021.105288
Related Items
An introduction to stochastic bin packing-based server consolidation with conflicts ⋮ Multi-period bin packing model and effective constructive heuristics for corridor-based logistics capacity planning ⋮ Mathematical models and approximate solution approaches for the stochastic bin packing problem ⋮ Lower and upper bounding procedures for the bin packing problem with concave loading cost ⋮ Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows ⋮ A combinatorial flow-based formulation for temporal bin packing problems ⋮ Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups
Cites Work
- Unnamed Item
- Unnamed Item
- Logistics capacity planning: a stochastic bin packing formulation and a progressive hedging meta-heuristic
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- Bin packing and related problems: general arc-flow formulation with graph compression
- Tight absolute bound for first fit decreasing bin-packing: \(\operatorname{FFD}(L)\leq 11/9 \operatorname{OPT}(L)+6/9\)
- Stabilized branch-and-price algorithms for vector packing problems
- New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation
- Exact algorithms for the two-dimensional strip packing problem with and without rotations
- Scheduling jobs with fixed start and end times
- Exact solution of bin-packing problems using column generation and branch-and-bound
- A branch-and-bound algorithm for the two-dimensional vector packing problem
- Solving binary cutting stock problems by column generation and branch- and-bound
- Branch-and-price algorithms for the one-dimensional cutting stock problem
- Introduction to cutting and packing optimization. Problems, modeling approaches, solution methods
- Large-scale unit commitment under uncertainty: an updated literature survey
- A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems
- A generalized bin packing problem for parcel delivery in last-mile logistics
- Two-dimensional packing problems: a survey
- LP models for bin packing and cutting stock problems
- Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation
- A branch-and-price algorithm for the temporal bin packing problem
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
- Multi-objective temporal bin packing problem: an application in cloud computing
- Mathematical Methods of Organizing and Planning Production
- Dual Inequalities for Stabilized Column Generation Revisited
- An Exact Approach to the Strip-Packing Problem
- Using Extra Dual Cuts to Accelerate Column Generation
- Combinatorial Benders' Cuts for the Strip Packing Problem
- A Stochastic Model for Estimating the Power Consumption of a Processor
- A Linear Programming Approach to the Cutting-Stock Problem
- Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem
- Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems
- 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
