Imagen de Portada

Economic Warehouse Lot Scheduling: Approximation Schemes via Efficiently-Representable DP-Encoded Policies

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Segev, Danny
Formato:	Preprint
Publicado:	2026
Materias:	Data Structures and Algorithms Optimization and Control
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

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

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

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

Near-Optimal Dynamic Policies for Joint Replenishment in Continuous/Discrete Time
por: Segev, Danny
Publicado: (2025)

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

3.415-Approximation for Coflow Scheduling via Iterated Rounding
por: Rohwedder, Lars, et al.
Publicado: (2025)

Branch-and-Bound Algorithms as Polynomial-time Approximation Schemes
por: Encz, Koppány István, et al.
Publicado: (2025)

Fully Subexponential Time Approximation Scheme for Product Partition
por: Costandin, Marius
Publicado: (2024)

Approximation Algorithms for Fair Repetitive Scheduling
por: Hermelin, Danny, et al.
Publicado: (2025)

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

Robust Gittins for Stochastic Scheduling
por: Moseley, Benjamin, et al.
Publicado: (2025)

ALNS for Tugboat Scheduling in Inland Waterway
por: Ma, Zihang
Publicado: (2025)

Warehouse storage and retrieval optimization via clustering, dynamical systems modeling, and GPU-accelerated routing
por: Bengtsson, Magnus, et al.
Publicado: (2025)

Parameterized Complexity of Scheduling Problems in Robotic Process Automation
por: Dvořák, Michal, et al.
Publicado: (2026)

Acceleration by Random Stepsizes: Hedging, Equalization, and the Arcsine Stepsize Schedule
por: Altschuler, Jason M., et al.
Publicado: (2024)

Sum-Of-Squares To Approximate Knapsack
por: Kothari, Pravesh K., et al.
Publicado: (2025)

Bounds for the Permutation Flowshop Scheduling Problem: New Framework and Theoretical Insights
por: Alejandro-Soto, J. A., et al.
Publicado: (2025)

Acceleration by Stepsize Hedging I: Multi-Step Descent and the Silver Stepsize Schedule
por: Altschuler, Jason M., et al.
Publicado: (2023)

Accelerated Approximate Optimization of Multi-Commodity Flows on Directed Graphs
por: Chen, Li, et al.
Publicado: (2025)

Two-sided Assortment Optimization: Adaptivity Gaps and Approximation Algorithms
por: Housni, Omar El, et al.
Publicado: (2024)

On Approximation of Robust Max-Cut and Related Problems using Randomized Rounding Algorithms
por: Shi, Haoyan, et al.
Publicado: (2024)

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

Efficient Approximation Schemes for Stochastic Probing and Selection-Stopping Problems
por: Segev, Danny, et al.
Publicado: (2020)

An Efficient Algorithm for Minimizing Ordered Norms in Fractional Load Balancing
por: Blankenburg, Daniel, et al.
Publicado: (2025)

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

Improved Speed via Regional Fulfillment
por: Hathcock, Daniel, et al.
Publicado: (2026)

Provably Efficient Infinite-Horizon Average-Reward Reinforcement Learning with Linear Function Approximation
por: Chae, Woojin, et al.
Publicado: (2024)

Extracting Dual Solutions via Primal Optimizers
por: Carmon, Yair, et al.
Publicado: (2024)

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

Accelerating Proximal Gradient Descent via Silver Stepsizes
por: Bok, Jinho, et al.
Publicado: (2024)

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

Flow Shop Scheduling with Stochastic Reentry
por: von Aspern, Maximilian, et al.
Publicado: (2026)

Improved $\ell_{p}$ Regression via Iteratively Reweighted Least Squares
por: Ene, Alina, et al.
Publicado: (2025)

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

TSP integrality gap via 2-edge-connected multisubgraph problem under coincident IP optima
por: Yamanaka, Toshiaki
Publicado: (2025)

Learning to Schedule in Parallel-Server Queues with Stochastic Bilinear Rewards
por: Kim, Jung-hun, et al.
Publicado: (2021)

New Approximation Guarantees for The Inventory Staggering Problem
por: Alon, Noga, et al.
Publicado: (2025)

Polyamorous Scheduling
por: Gąsieniec, Leszek, et al.
Publicado: (2024)