Resource-Constrained Joint Replenishment via Power-of-$m^{1/k}$ Policies
Fuente:
arXiv
Saved in:
| Main Author: | Segev, Danny |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Near-Optimal Dynamic Policies for Joint Replenishment in Continuous/Discrete Time
by: Segev, Danny
Published: (2025)
by: Segev, Danny
Published: (2025)
Improved Approximation Guarantees for Joint Replenishment in Continuous Time
by: Segev, Danny
Published: (2024)
by: Segev, Danny
Published: (2024)
Economic Warehouse Lot Scheduling: Approximation Schemes via Efficiently-Representable DP-Encoded Policies
by: Segev, Danny
Published: (2026)
by: Segev, Danny
Published: (2026)
Economic Warehouse Lot Scheduling: Breaking the 2-Approximation Barrier
by: Segev, Danny
Published: (2026)
by: Segev, Danny
Published: (2026)
New Approximation Guarantees for The Economic Warehouse Lot Scheduling Problem
by: Segev, Danny
Published: (2024)
by: Segev, Danny
Published: (2024)
Approximation Schemes for Sequential Hiring Problems
by: Segev, Danny, et al.
Published: (2026)
by: Segev, Danny, et al.
Published: (2026)
Improved Approximation Guarantees and Hardness Results for MNL-Driven Product Ranking
by: Segev, Danny, et al.
Published: (2025)
by: Segev, Danny, et al.
Published: (2025)
Online Linear Programming with Replenishment
by: Chen, Yuze, et al.
Published: (2026)
by: Chen, Yuze, et al.
Published: (2026)
Dynamic Pricing for Reusable Resources: The Power of Two Prices
by: Balseiro, Santiago R., et al.
Published: (2023)
by: Balseiro, Santiago R., et al.
Published: (2023)
Revenue Maximization in Choice-Based Matching Markets
by: Nissim, Dan, et al.
Published: (2024)
by: Nissim, Dan, et al.
Published: (2024)
On contention resolution for the hypergraph matching, knapsack, and $k$-column sparse packing problems
by: Sergeev, Ivan
Published: (2024)
by: Sergeev, Ivan
Published: (2024)
A Two-Layer Framework for Joint Online Configuration Selection and Admission Control
by: Shen, Owen, et al.
Published: (2026)
by: Shen, Owen, et al.
Published: (2026)
Scalable First-Order Interior Point Trust Region Algorithms for Linearly Constrained Optimization
by: Su, Yuexin, et al.
Published: (2026)
by: Su, Yuexin, et al.
Published: (2026)
Constrained and Composite Sampling via Proximal Sampler
by: Dang, Thanh, et al.
Published: (2026)
by: Dang, Thanh, et al.
Published: (2026)
Improved Speed via Regional Fulfillment
by: Hathcock, Daniel, et al.
Published: (2026)
by: Hathcock, Daniel, et al.
Published: (2026)
Extracting Dual Solutions via Primal Optimizers
by: Carmon, Yair, et al.
Published: (2024)
by: Carmon, Yair, et al.
Published: (2024)
Radial Isotropic Position via an Implicit Newton's Method
by: Jambulapati, Arun, et al.
Published: (2025)
by: Jambulapati, Arun, et al.
Published: (2025)
Accelerating Proximal Gradient Descent via Silver Stepsizes
by: Bok, Jinho, et al.
Published: (2024)
by: Bok, Jinho, et al.
Published: (2024)
Near-Optimal Sample Complexity for MDPs via Anchoring
by: Lee, Jongmin, et al.
Published: (2025)
by: Lee, Jongmin, et al.
Published: (2025)
A 1/2-Approximation for Budgeted $k$-Submodular Maximization
by: Wang, Chenhao
Published: (2025)
by: Wang, Chenhao
Published: (2025)
3.415-Approximation for Coflow Scheduling via Iterated Rounding
by: Rohwedder, Lars, et al.
Published: (2025)
by: Rohwedder, Lars, et al.
Published: (2025)
Improved $\ell_{p}$ Regression via Iteratively Reweighted Least Squares
by: Ene, Alina, et al.
Published: (2025)
by: Ene, Alina, et al.
Published: (2025)
Optimal Micro-Transit Zoning via Clique Generation and Integer Programming
by: Hu, Hins, et al.
Published: (2025)
by: Hu, Hins, et al.
Published: (2025)
TSP integrality gap via 2-edge-connected multisubgraph problem under coincident IP optima
by: Yamanaka, Toshiaki
Published: (2025)
by: Yamanaka, Toshiaki
Published: (2025)
Dynamic Resource Allocation: Algorithmic Design Principles and Spectrum of Achievable Performances
by: Besbes, Omar, et al.
Published: (2022)
by: Besbes, Omar, et al.
Published: (2022)
Cascading-Tree Algorithm for the 0-1 Knapsack Problem (In Memory of Heiner M{ü}ller-Merbach, a Former President of IFORS)
by: Moeini, Mahdi, et al.
Published: (2024)
by: Moeini, Mahdi, et al.
Published: (2024)
Optimal Bounds for Adversarial Constrained Online Convex Optimization
by: Ferreira, Ricardo N., et al.
Published: (2025)
by: Ferreira, Ricardo N., et al.
Published: (2025)
Gradient-Free Method for Heavily Constrained Nonconvex Optimization
by: Shi, Wanli, et al.
Published: (2024)
by: Shi, Wanli, et al.
Published: (2024)
Accelerated Algorithms for Constrained Nonconvex-Nonconcave Min-Max Optimization and Comonotone Inclusion
by: Cai, Yang, et al.
Published: (2022)
by: Cai, Yang, et al.
Published: (2022)
Quantum-inspired Tensor Network for QUBO, QUDO and Tensor QUDO Problems with k-neighbors
by: Subiñas, Sergio Muñiz, et al.
Published: (2026)
by: Subiñas, Sergio Muñiz, et al.
Published: (2026)
Parameterized Complexity of Scheduling Problems in Robotic Process Automation
by: Dvořák, Michal, et al.
Published: (2026)
by: Dvořák, Michal, et al.
Published: (2026)
Coordinating Spot and Contract Supply in Freight Marketplaces
by: Kaminsky, Philip, et al.
Published: (2026)
by: Kaminsky, Philip, et al.
Published: (2026)
On the Complexity of Bilevel Independent Set Problem
by: Muluk, Komal
Published: (2026)
by: Muluk, Komal
Published: (2026)
Handicap reduction for linear complementarity problems
by: -Nagy, Marianna E., et al.
Published: (2026)
by: -Nagy, Marianna E., et al.
Published: (2026)
Optimizing for Fairness in Generalized Kidney Exchange: Theory and Computations
by: Chang, Claire, et al.
Published: (2026)
by: Chang, Claire, et al.
Published: (2026)
Stepsize Hedging: an Alternative Mechanism for Accelerating Gradient Descent
by: Altschuler, Jason M., et al.
Published: (2026)
by: Altschuler, Jason M., et al.
Published: (2026)
Circuit Diameter of Polyhedra is Strongly Polynomial
by: Natura, Bento
Published: (2026)
by: Natura, Bento
Published: (2026)
(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs
by: Hunkenschröder, Christoph, et al.
Published: (2025)
by: Hunkenschröder, Christoph, et al.
Published: (2025)
Computational complexity of the recoverable robust shortest path problem in acyclic digraphs
by: Kasperski, Adam, et al.
Published: (2024)
by: Kasperski, Adam, et al.
Published: (2024)
Generalized Assignment and Knapsack Problems in the Random-Order Model
by: Klimm, Max, et al.
Published: (2025)
by: Klimm, Max, et al.
Published: (2025)
Similar Items
-
Near-Optimal Dynamic Policies for Joint Replenishment in Continuous/Discrete Time
by: Segev, Danny
Published: (2025) -
Improved Approximation Guarantees for Joint Replenishment in Continuous Time
by: Segev, Danny
Published: (2024) -
Economic Warehouse Lot Scheduling: Approximation Schemes via Efficiently-Representable DP-Encoded Policies
by: Segev, Danny
Published: (2026) -
Economic Warehouse Lot Scheduling: Breaking the 2-Approximation Barrier
by: Segev, Danny
Published: (2026) -
New Approximation Guarantees for The Economic Warehouse Lot Scheduling Problem
by: Segev, Danny
Published: (2024)