Cover Image

New Approximation Guarantees for The Economic Warehouse Lot Scheduling Problem

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Segev, Danny
Format:	Preprint
Published:	2024
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

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

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

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

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)

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

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

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

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

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

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

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

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

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

Robust Gittins for Stochastic Scheduling
by: Moseley, Benjamin, et al.
Published: (2025)

Differentiable Extensions with Rounding Guarantees for Combinatorial Optimization over Permutations
by: Nerem, Robert R., et al.
Published: (2024)

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

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

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

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

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

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

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

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

The Robust Bilevel Selection Problem
by: Henke, Dorothee
Published: (2024)

The Fair Periodic Assignment Problem
by: van Lieshout, Rolf, et al.
Published: (2025)

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

On the Complexity of Bilevel Independent Set Problem
by: Muluk, Komal
Published: (2026)

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

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

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

Solving the Probabilistic Profitable Tour Problem on a Tree
by: Angelelli, Enrico, et al.
Published: (2022)

A Faster Parametric Search for the Integral Quickest Transshipment Problem
by: Anapolska, Mariia, 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)

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)

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

Safe Sequences via Dominators in DAGs for Path-Covering Problems
by: Sena, Francisco, et al.
Published: (2024)

A Threshold Phenomenon for the Shortest Lattice Vector Problem in the Infinity Norm
by: Kuhlmann, Stefan, et al.
Published: (2025)

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

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