Warehouse storage and retrieval optimization via clustering, dynamical systems modeling, and GPU-accelerated routing
Fuente:
arXiv
Saved in:
| Main Authors: | Bengtsson, Magnus, Wittsten, Jens, Waidringer, Jonas |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Economic Warehouse Lot Scheduling: Approximation Schemes via Efficiently-Representable DP-Encoded Policies
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)
Economic Warehouse Lot Scheduling: Breaking the 2-Approximation Barrier
by: Segev, Danny
Published: (2026)
by: Segev, Danny
Published: (2026)
Assortment optimization given basket shopping behavior using the Ising model
by: Vasilyev, Andrey, et al.
Published: (2025)
by: Vasilyev, Andrey, et al.
Published: (2025)
Convex optimization with $p$-norm oracles
by: Adil, Deeksha, et al.
Published: (2024)
by: Adil, Deeksha, et al.
Published: (2024)
A rounding and clustering-based exact algorithm for the p-center problem
by: Ales, Zacharie, et al.
Published: (2024)
by: Ales, Zacharie, et al.
Published: (2024)
Availability is all you need: achieving optimal regret with minimal information for dynamic matching
by: Kerimov, Süleyman, et al.
Published: (2025)
by: Kerimov, Süleyman, et al.
Published: (2025)
Optimized methods for composite optimization: a reduction perspective
by: Bok, Jinho, et al.
Published: (2025)
by: Bok, Jinho, et al.
Published: (2025)
Competitive Online Optimization under Inventory Constraints
by: Lin, Qiulin, et al.
Published: (2019)
by: Lin, Qiulin, et al.
Published: (2019)
A nearly optimal randomized algorithm for explorable heap selection
by: Borst, Sander, et al.
Published: (2022)
by: Borst, Sander, et al.
Published: (2022)
An Efficient Algorithm for Minimizing Ordered Norms in Fractional Load Balancing
by: Blankenburg, Daniel, et al.
Published: (2025)
by: Blankenburg, Daniel, et al.
Published: (2025)
Improved Speed via Regional Fulfillment
by: Hathcock, Daniel, et al.
Published: (2026)
by: Hathcock, Daniel, et al.
Published: (2026)
A note on the complexity of the picker routing problem in multi-block warehouses and related problems
by: Prunet, Thibault, et al.
Published: (2023)
by: Prunet, Thibault, et al.
Published: (2023)
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)
Periodic trajectories in P-time event graphs and the non-positive circuit weight problem
by: Zorzenon, Davide, et al.
Published: (2021)
by: Zorzenon, Davide, et al.
Published: (2021)
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)
Resource-Constrained Joint Replenishment via Power-of-$m^{1/k}$ Policies
by: Segev, Danny
Published: (2026)
by: Segev, Danny
Published: (2026)
TSP integrality gap via 2-edge-connected multisubgraph problem under coincident IP optima
by: Yamanaka, Toshiaki
Published: (2025)
by: Yamanaka, Toshiaki
Published: (2025)
BalLOT: Balanced $k$-means clustering with optimal transport
by: Luo, Wenyan, et al.
Published: (2025)
by: Luo, Wenyan, et al.
Published: (2025)
Quantum speedups for stochastic optimization
by: Sidford, Aaron, et al.
Published: (2023)
by: Sidford, Aaron, et al.
Published: (2023)
Expanding the reach of quantum optimization with fermionic embeddings
by: Zhao, Andrew, et al.
Published: (2023)
by: Zhao, Andrew, et al.
Published: (2023)
(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)
An Optimal Algorithm for the Stacker Crane Problem on Fixed Topologies
by: Chen, Yike, et al.
Published: (2024)
by: Chen, Yike, et al.
Published: (2024)
Balancing Gradient and Hessian Queries in Non-Convex Optimization
by: Adil, Deeksha, et al.
Published: (2025)
by: Adil, Deeksha, et al.
Published: (2025)
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)
Deriving the Gradients of Some Popular Optimal Transport Algorithms
by: Xie, Fangzhou
Published: (2025)
by: Xie, Fangzhou
Published: (2025)
Coordinating Spot and Contract Supply in Freight Marketplaces
by: Kaminsky, Philip, et al.
Published: (2026)
by: Kaminsky, Philip, 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)
Labeling Methods for Partially Ordered Paths
by: Euler, Ricardo, et al.
Published: (2023)
by: Euler, Ricardo, et al.
Published: (2023)
Sparse Submodular Function Minimization
by: Graur, Andrei, et al.
Published: (2023)
by: Graur, Andrei, et al.
Published: (2023)
On Approximation of Robust Max-Cut and Related Problems using Randomized Rounding Algorithms
by: Shi, Haoyan, et al.
Published: (2024)
by: Shi, Haoyan, 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)
Distributionally Robust Newsvendor on a Metric
by: Foussoul, Ayoub, et al.
Published: (2024)
by: Foussoul, Ayoub, et al.
Published: (2024)
Similar Items
-
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) -
Assortment optimization given basket shopping behavior using the Ising model
by: Vasilyev, Andrey, et al.
Published: (2025) -
Convex optimization with $p$-norm oracles
by: Adil, Deeksha, et al.
Published: (2024)