Interior-Point-Based Online Stochastic Bin Packing
From MaRDI portal
Publication:5144776
DOI10.1287/opre.2019.1914zbMath1457.90123arXiv1211.2687OpenAlexW3121305472MaRDI QIDQ5144776
No author found.
Publication date: 19 January 2021
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1211.2687
Related Items (3)
Asymptotic optimality of a greedy randomized algorithm in a large-scale service system with general packing constraints ⋮ Large-scale heterogeneous service systems with general packing constraints ⋮ Adaptive Bin Packing with Overflow
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bounded-space online bin cover
- The average-case analysis of some on-line algorithms for bin packing
- Exponential penalty function control of loss networks
- Stochastic bandwidth packing process: stability conditions via Lyapunov function technique
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- Bandwidth packing
- Average case analysis of bounded space bin packing algorithms
- Maximizing queueing network utility subject to stability: greedy primal-dual algorithm
- How the Experts Algorithm Can Help Solve LPs Online
- Stochastic Network Optimization with Application to Communication and Queueing Systems
- Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue
- On the Sum-of-Squares algorithm for bin packing
- Necessary and sufficient conditions for stability of a bin-packing system
- A simple on-line bin-packing algorithm
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- On-Line Bin Packing of Items of Random Sizes, II
- Linear waste of best fit bin packing on skewed distributions
- Price-Directed Control of Remnant Inventory Systems
- Resource augmentation for online bounded space bin packing
- Fast Approximation Algorithms for Fractional Packing and Covering Problems
- Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
- Fast Algorithms for Online Stochastic Convex Programming
- The optimal absolute ratio for online bin packing
- Lower Bounds for Quantile Estimation in Random-Order and Multi-pass Streaming
- Analysis of Stochastic Online Bin Packing Processes
- Bin Packing with Queues
This page was built for publication: Interior-Point-Based Online Stochastic Bin Packing
