Image de couverture de livre

Economic Warehouse Lot Scheduling: Breaking the 2-Approximation Barrier

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Segev, Danny
Format:	Preprint
Publié:	2026
Sujets:	Data Structures and Algorithms Optimization and Control
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

New Approximation Guarantees for The Economic Warehouse Lot Scheduling Problem
par: Segev, Danny
Publié: (2024)

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

Improved Approximation Guarantees for Joint Replenishment in Continuous Time
par: Segev, Danny
Publié: (2024)

Approximation Schemes for Sequential Hiring Problems
par: Segev, Danny, et autres
Publié: (2026)

Improved Approximation Guarantees and Hardness Results for MNL-Driven Product Ranking
par: Segev, Danny, et autres
Publié: (2025)

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

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

Breaking the Barrier of Self-Concordant Barriers: Faster Interior Point Methods for M-Matrices
par: Vladu, Adrian
Publié: (2025)

3.415-Approximation for Coflow Scheduling via Iterated Rounding
par: Rohwedder, Lars, et autres
Publié: (2025)

Approximation Algorithms for Fair Repetitive Scheduling
par: Hermelin, Danny, et autres
Publié: (2025)

Revenue Maximization in Choice-Based Matching Markets
par: Nissim, Dan, et autres
Publié: (2024)

Robust Gittins for Stochastic Scheduling
par: Moseley, Benjamin, et autres
Publié: (2025)

ALNS for Tugboat Scheduling in Inland Waterway
par: Ma, Zihang
Publié: (2025)

Parameterized Complexity of Scheduling Problems in Robotic Process Automation
par: Dvořák, Michal, et autres
Publié: (2026)

Acceleration by Random Stepsizes: Hedging, Equalization, and the Arcsine Stepsize Schedule
par: Altschuler, Jason M., et autres
Publié: (2024)

Sum-Of-Squares To Approximate Knapsack
par: Kothari, Pravesh K., et autres
Publié: (2025)

Bounds for the Permutation Flowshop Scheduling Problem: New Framework and Theoretical Insights
par: Alejandro-Soto, J. A., et autres
Publié: (2025)

Acceleration by Stepsize Hedging I: Multi-Step Descent and the Silver Stepsize Schedule
par: Altschuler, Jason M., et autres
Publié: (2023)

Branch-and-Bound Algorithms as Polynomial-time Approximation Schemes
par: Encz, Koppány István, et autres
Publié: (2025)

Fully Subexponential Time Approximation Scheme for Product Partition
par: Costandin, Marius
Publié: (2024)

Accelerated Approximate Optimization of Multi-Commodity Flows on Directed Graphs
par: Chen, Li, et autres
Publié: (2025)

Two-sided Assortment Optimization: Adaptivity Gaps and Approximation Algorithms
par: Housni, Omar El, et autres
Publié: (2024)

Warehouse storage and retrieval optimization via clustering, dynamical systems modeling, and GPU-accelerated routing
par: Bengtsson, Magnus, et autres
Publié: (2025)

On Approximation of Robust Max-Cut and Related Problems using Randomized Rounding Algorithms
par: Shi, Haoyan, et autres
Publié: (2024)

Approximating $q \rightarrow p$ Norms of Non-Negative Matrices in Nearly-Linear Time
par: Objois, Étienne, et autres
Publié: (2025)

Breaking the Heavy-Tailed Noise Barrier in Stochastic Optimization Problems
par: Puchkin, Nikita, et autres
Publié: (2023)

Flow Shop Scheduling with Stochastic Reentry
par: von Aspern, Maximilian, et autres
Publié: (2026)

A 1/2-Approximation for Budgeted $k$-Submodular Maximization
par: Wang, Chenhao
Publié: (2025)

Learning to Schedule in Parallel-Server Queues with Stochastic Bilinear Rewards
par: Kim, Jung-hun, et autres
Publié: (2021)

New Approximation Guarantees for The Inventory Staggering Problem
par: Alon, Noga, et autres
Publié: (2025)

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

Polyamorous Scheduling
par: Gąsieniec, Leszek, et autres
Publié: (2024)

Quantum Approximate Optimization Algorithms for Maximum Cut on Low-Girth Graphs
par: Li, Tongyang, et autres
Publié: (2024)

Coordinating Spot and Contract Supply in Freight Marketplaces
par: Kaminsky, Philip, et autres
Publié: (2026)

Scalable First-Order Interior Point Trust Region Algorithms for Linearly Constrained Optimization
par: Su, Yuexin, et autres
Publié: (2026)

On the Complexity of Bilevel Independent Set Problem
par: Muluk, Komal
Publié: (2026)

Handicap reduction for linear complementarity problems
par: -Nagy, Marianna E., et autres
Publié: (2026)

Optimizing for Fairness in Generalized Kidney Exchange: Theory and Computations
par: Chang, Claire, et autres
Publié: (2026)

Improved Speed via Regional Fulfillment
par: Hathcock, Daniel, et autres
Publié: (2026)

Stepsize Hedging: an Alternative Mechanism for Accelerating Gradient Descent
par: Altschuler, Jason M., et autres
Publié: (2026)