Image de couverture de livre

Two-sided Assortment Optimization: Adaptivity Gaps and Approximation Algorithms

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Housni, Omar El, Hennebelle, Ulysse, Torrico, Alfredo
Format:	Preprint
Publié:	2024
Sujets:	Optimization and Control 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

When Location Shapes Choice: Placement Optimization of Substitutable Products
par: Housni, Omar El, et autres
Publié: (2023)

A Unified Algorithmic Framework for Dynamic Assortment Optimization under MNL Choice
par: Sun, Shuo, et autres
Publié: (2024)

Submodular Order Functions and Assortment Optimization
par: Udwani, Rajan
Publié: (2021)

Fair Assortment Planning
par: Chen, Qinyi, et autres
Publié: (2022)

Maximum Load Assortment Optimization: Approximation Algorithms and Adaptivity Gaps
par: Housni, Omar El, et autres
Publié: (2023)

Assortment optimization given basket shopping behavior using the Ising model
par: Vasilyev, Andrey, et autres
Publié: (2025)

Adaptive Two-sided Assortment Optimization: Revenue Maximization
par: Ahmadnejadsaein, Mohammadreza, et autres
Publié: (2025)

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

Adversarially-Robust Gossip Algorithms for Approximate Quantile and Mean Computations
par: Haeupler, Bernhard, et autres
Publié: (2025)

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

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

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

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

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

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

Dynamic Resource Allocation: Algorithmic Design Principles and Spectrum of Achievable Performances
par: Besbes, Omar, et autres
Publié: (2022)

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

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

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

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

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

Economic Warehouse Lot Scheduling: Breaking the 2-Approximation Barrier
par: Segev, Danny
Publié: (2026)

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

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

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

An Optimal Algorithm for the Stacker Crane Problem on Fixed Topologies
par: Chen, Yike, et autres
Publié: (2024)

Deriving the Gradients of Some Popular Optimal Transport Algorithms
par: Xie, Fangzhou
Publié: (2025)

Solving Linear Programs with Fast Online Learning Algorithms
par: Gao, Wenzhi, et autres
Publié: (2021)

Dynamic Pricing for Reusable Resources: The Power of Two Prices
par: Balseiro, Santiago R., et autres
Publié: (2023)

Adaptive Matrix Sparsification and Applications to Empirical Risk Minimization
par: Liu, Yang P., et autres
Publié: (2025)

(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs
par: Hunkenschröder, Christoph, et autres
Publié: (2025)

An Efficient Algorithm for Minimizing Ordered Norms in Fractional Load Balancing
par: Blankenburg, Daniel, et autres
Publié: (2025)

A Variational-Calculus Approach to Online Algorithm Design and Analysis
par: Xu, Pan
Publié: (2025)

Optimization in Sanger Sequencing
par: Carpente, Luisa, et autres
Publié: (2024)

Optimization of Next-Day Delivery Coverage using Constraint Programming and Random Key Optimizers
par: Brubaker, Kyle, et autres
Publié: (2025)

A Two-Layer Framework for Joint Online Configuration Selection and Admission Control
par: Shen, Owen, et autres
Publié: (2026)

Closing the Computational-Query Depth Gap in Parallel Stochastic Convex Optimization
par: Jambulapati, Arun, et autres
Publié: (2024)

Online Bipartite Matching with Advice: Tight Robustness-Consistency Tradeoffs for the Two-Stage Model
par: Jin, Billy, et autres
Publié: (2022)

Stay or Switch: Competitive Online Algorithms for Energy Plan Selection in Energy Markets with Retail Choice
par: Zhai, Jianing, et autres
Publié: (2019)

Extracting Dual Solutions via Primal Optimizers
par: Carmon, Yair, et autres
Publié: (2024)