Cover Image

Near-Optimal Dynamic Policies for Joint Replenishment in Continuous/Discrete Time

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Segev, Danny
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Improved Approximation Guarantees for Joint Replenishment in Continuous Time
by: Segev, Danny
Published: (2024)

Resource-Constrained Joint Replenishment via Power-of-$m^{1/k}$ Policies
by: Segev, Danny
Published: (2026)

Economic Warehouse Lot Scheduling: Approximation Schemes via Efficiently-Representable DP-Encoded Policies
by: Segev, Danny
Published: (2026)

New Approximation Guarantees for The Economic Warehouse Lot Scheduling Problem
by: Segev, Danny
Published: (2024)

Economic Warehouse Lot Scheduling: Breaking the 2-Approximation Barrier
by: Segev, Danny
Published: (2026)

Improved Approximation Guarantees and Hardness Results for MNL-Driven Product Ranking
by: Segev, Danny, et al.
Published: (2025)

Approximation Schemes for Sequential Hiring Problems
by: Segev, Danny, et al.
Published: (2026)

Online Linear Programming with Replenishment
by: Chen, Yuze, et al.
Published: (2026)

Near-Optimal Sample Complexity for MDPs via Anchoring
by: Lee, Jongmin, et al.
Published: (2025)

(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs
by: Hunkenschröder, Christoph, et al.
Published: (2025)

Revenue Maximization in Choice-Based Matching Markets
by: Nissim, Dan, et al.
Published: (2024)

Approximating $q \rightarrow p$ Norms of Non-Negative Matrices in Nearly-Linear Time
by: Objois, Étienne, et al.
Published: (2025)

Discrete and Continuous Difference of Submodular Minimization
by: Orfanides, George, et al.
Published: (2025)

Near-Optimal Quantum Algorithm for Minimizing the Maximal Loss
by: Wang, Hao, et al.
Published: (2024)

A Two-Layer Framework for Joint Online Configuration Selection and Admission Control
by: Shen, Owen, et al.
Published: (2026)

Bayesian Optimal Stopping with Maximum Value Knowledge
by: Kleer, Pieter, et al.
Published: (2025)

Deriving the Gradients of Some Popular Optimal Transport Algorithms
by: Xie, Fangzhou
Published: (2025)

An Optimal Algorithm for the Stacker Crane Problem on Fixed Topologies
by: Chen, Yike, et al.
Published: (2024)

Optimal Micro-Transit Zoning via Clique Generation and Integer Programming
by: Hu, Hins, et al.
Published: (2025)

The Restricted Inverse Optimal Value Problem under Weighted Bottle-neck Hamming distance on trees
by: Zhang, Qiao, et al.
Published: (2024)

Continuous Non-monotone DR-submodular Maximization with Down-closed Convex Constraint
by: Chen, Shengminjie, et al.
Published: (2023)

A Decomposition Theorem for Dynamic Flows
by: Graf, Lukas, et al.
Published: (2024)

Online Decision Making with Fairness over Time
by: Chen, Rui, et al.
Published: (2022)

Fully Subexponential Time Approximation Scheme for Product Partition
by: Costandin, Marius
Published: (2024)

Dynamic Pricing for Reusable Resources: The Power of Two Prices
by: Balseiro, Santiago R., et al.
Published: (2023)

Dynamic Batching of Online Arrivals to Leverage Economies of Scale
by: Bhimaraju, Akhil, et al.
Published: (2023)

A Unified Algorithmic Framework for Dynamic Assortment Optimization under MNL Choice
by: Sun, Shuo, et al.
Published: (2024)

Low Rank Matrix Completion via Robust Alternating Minimization in Nearly Linear Time
by: Gu, Yuzhou, et al.
Published: (2023)

A Continuous-Time Perspective on Global Acceleration for Monotone Equation Problems
by: Lin, Tianyi, et al.
Published: (2022)

Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem
by: Gao, Xuan-Zhao, et al.
Published: (2024)

Solving Matrix Games with Near-Optimal Matvec Complexity
by: Karmarkar, Ishani, et al.
Published: (2026)

Near-Linear Runtime for a Classical Matrix Preconditioning Algorithm
by: Cai, Xufeng, et al.
Published: (2025)

Dynamic Resource Allocation: Algorithmic Design Principles and Spectrum of Achievable Performances
by: Besbes, Omar, et al.
Published: (2022)

Near-Optimal Parameter Tuning of Level-1 QAOA for Ising Models
by: Vijendran, V, et al.
Published: (2025)

Generalized Assignment and Knapsack Problems in the Random-Order Model
by: Klimm, Max, et al.
Published: (2025)

Radial Isotropic Position via an Implicit Newton's Method
by: Jambulapati, Arun, et al.
Published: (2025)

Balancing Gradient and Hessian Queries in Non-Convex Optimization
by: Adil, Deeksha, et al.
Published: (2025)

ALNS for Tugboat Scheduling in Inland Waterway
by: Ma, Zihang
Published: (2025)

A Faster Parametric Search for the Integral Quickest Transshipment Problem
by: Anapolska, Mariia, et al.
Published: (2025)

An Efficient Frequency-Based Approach for Maximal Square Detection in Binary Matrices
by: Bhandari, Swastik
Published: (2025)