Image de couverture de livre

Optimizing Inventory Placement for a Downstream Online Matching Problem

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Epstein, Boris, Ma, Will
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A New Impossibility Result for Online Bipartite Matching Problems
par: Chierichetti, Flavio, et autres
Publié: (2025)

Randomized Rounding Approaches to Online Allocation, Sequencing, and Matching
par: Ma, Will
Publié: (2024)

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

Improved Online Algorithms for Inventory Management Problems with Holding and Delay Costs: Riding the Wave Makes Things Simpler, Stronger, & More General
par: Shmoys, David, et autres
Publié: (2026)

Online Matching: A Brief Survey
par: Huang, Zhiyi, et autres
Publié: (2024)

On the Advice Complexity of Online Matching on the Line
par: Csaba, Béla, et autres
Publié: (2024)

Online Matching in Geometric Random Graphs
par: Sentenac, Flore, et autres
Publié: (2023)

The Competitive Ratio of Threshold Policies for Online Unit-density Knapsack Problems
par: Ma, Will, et autres
Publié: (2019)

Almost Tight Bounds for Online Hypergraph Matching
par: Tröbst, Thorben, et autres
Publié: (2024)

Online Metric Matching: Beyond the Worst Case
par: Yang, Mingwei, et autres
Publié: (2024)

Online Matching with Delays and Size-based Costs
par: Kawase, Yasushi, et autres
Publié: (2024)

The Online Submodular Assignment Problem
par: Hathcock, Daniel, et autres
Publié: (2024)

The Online Submodular Assignment Problem
par: Hathcock, Daniel, et autres
Publié: (2024)

The Online Submodular Cover Problem
par: Gupta, Anupam, et autres
Publié: (2025)

Online Knapsack Problems with Estimates
par: Balabán, Jakub, et autres
Publié: (2025)

The Power of Greedy for Online Minimum Cost Matching on the Line
par: Balkanski, Eric, et autres
Publié: (2022)

Online Dependent Rounding Schemes for Bipartite Matchings, with Applications
par: Joseph, et autres
Publié: (2023)

Online Deterministic Minimum Cost Bipartite Matching with Delays on a Line
par: Kuo, Tung-Wei
Publié: (2024)

On the Online Weighted Non-Crossing Matching Problem
par: Boyar, Joan, et autres
Publié: (2026)

Smoothed Analysis of Online Metric Problems
par: Coester, Christian, et autres
Publié: (2025)

Learning-Augmented Online Covering Problems
par: Ameli, Afrouz Jabal, et autres
Publié: (2025)

Online Stochastic Matching with Unknown Arrival Order: Beating $0.5$ against the Online Optimum
par: Sun, Enze, et autres
Publié: (2025)

On Approximate Fully-Dynamic Matching and Online Matrix-Vector Multiplication
par: Liu, Yang P.
Publié: (2024)

Degree-bounded Online Bipartite Matching: OCS vs. Ranking
par: Feng, Yilong, et autres
Publié: (2025)

Downstream: efficient cross-platform algorithms for fixed-capacity stream downsampling
par: Yang, Connor, et autres
Publié: (2025)

Complexity Classes for Online Problems with and without Predictions
par: Berg, Magnus, et autres
Publié: (2024)

Online Rounding Schemes for $ k $-Rental Problems
par: Nekouyan, Hossein, et autres
Publié: (2025)

Nearly Tight Bounds for the Online Sorting Problem
par: Azar, Yossi, et autres
Publié: (2025)

Smoothed Analysis of Online Metric Matching with a Single Sample: Beyond Metric Distortion
par: Li, Yingxi, et autres
Publié: (2025)

A Nonparametric Framework for Online Stochastic Matching with Correlated Arrivals
par: Aouad, Ali, et autres
Publié: (2022)

Robustness of Online Inventory Balancing to Inventory Shocks
par: Feng, Yiding, et autres
Publié: (2025)

Edge Arrival Online Matching: The Power of Free Disposal on Acyclic Graphs
par: Jiang, Tianle, et autres
Publié: (2024)

New Philosopher Inequalities for Online Bayesian Matching, via Pivotal Sampling
par: Braverman, Mark, et autres
Publié: (2024)

When Stochastic Rewards Reduce to Deterministic Rewards in Online Bipartite Matching
par: Udwani, Rajan
Publié: (2023)

Comparing the Hardness of Online Minimization and Maximization Problems with Predictions
par: Berg, Magnus
Publié: (2024)

Potential-Based Greedy Matching for Dynamic Delivery Pooling
par: Ma, Hongyao, et autres
Publié: (2025)

Near-real-time Solutions for Online String Problems
par: Köppl, Dominik, et autres
Publié: (2026)

Competitive Online Optimization under Inventory Constraints
par: Lin, Qiulin, et autres
Publié: (2019)

Time Efficient Implementation for Online $k$-server Problem on Trees
par: Khadiev, Kamil, et autres
Publié: (2024)

Online Joint Replenishment Problem with Arbitrary Holding and Backlog Costs
par: Azar, Yossi, et autres
Publié: (2025)