Adaptive Bin Packing with Overflow
From MaRDI portal
Publication:5870378
DOI10.1287/moor.2021.1239OpenAlexW4214683296MaRDI QIDQ5870378
Alejandro Toriello, Mohit Singh, Sebastian Perez-Salazar
Publication date: 9 January 2023
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2007.11532
Combinatorial optimization (90C27) Dynamic programming (90C39) Markov and semi-Markov decision processes (90C40) Approximation algorithms (68W25)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A 13/12 approximation algorithm for bin packing with extendable bins
- Adaptivity in the stochastic blackjack knapsack problem
- New lower bounds for certain classes of bin packing algorithms
- The average-case analysis of some on-line algorithms for bin packing
- Bin packing can be solved within 1+epsilon in linear time
- An improved lower bound for on-line bin packing algorithms
- Resource constrained scheduling as generalized bin packing
- Online algorithms: a survey
- The price of fixed assignments in stochastic extensible bin packing
- Fast algorithms for bin packing
- A column and constraint generation algorithm for the dynamic knapsack problem with stochastic item sizes
- A dual bin-packing approach to scheduling surgical cases at a publicly-funded hospital
- Approximation and online algorithms for multidimensional bin packing: a survey
- Principles of combinatorial optimization applied to container-ship stowage planning
- The Dynamic and Stochastic Knapsack Problem
- Semi-Infinite Relaxations for the Dynamic Knapsack Problem with Stochastic Item Sizes
- The Online Stochastic Generalized Assignment Problem
- Optimal Allocation of Surgery Blocks to Operating Rooms Under Uncertainty
- Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity
- A Linear Programming Approach to the Cutting-Stock Problem
- On the Sum-of-Squares algorithm for bin packing
- The Dynamic and Stochastic Knapsack Problem with Random Sized Items
- Optimal Bin Packing with Items of Random Sizes
- The Complexity of Enumeration and Reliability Problems
- New Algorithms for Bin Packing
- A stochastic model of bin-packing
- A Renewal Decision Problem
- An Application of Bin-Packing to Multiprocessor Scheduling
- The Dynamic and Stochastic Knapsack Problem with Deadlines
- Bin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings
- Allocating Bandwidth for Bursty Connections
- A Logarithmic Additive Integrality Gap for Bin Packing
- Relaxation Analysis for the Dynamic Knapsack Problem with Stochastic Item Sizes
- Approximations to Stochastic Dynamic Programs via Information Relaxation Duality
- Interior-Point-Based Online Stochastic Bin Packing
- Improvements and Generalizations of Stochastic Knapsack and Markovian Bandits Approximation Algorithms
- Approximate Dynamic Programming
- Online Stochastic Matching with Unequal Probabilities
- Approximation Algorithms for Correlated Knapsacks and Non-martingale Bandits
- Stochastic combinatorial optimization via poisson approximation
This page was built for publication: Adaptive Bin Packing with Overflow
