Cover Image

When Location Shapes Choice: Placement Optimization of Substitutable Products

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Housni, Omar El, Udwani, Rajan
Format:	Preprint
Published:	2023
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

Submodular Order Functions and Assortment Optimization
by: Udwani, Rajan
Published: (2021)

A Unified Algorithmic Framework for Dynamic Assortment Optimization under MNL Choice
by: Sun, Shuo, et al.
Published: (2024)

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

When Stochastic Rewards Reduce to Deterministic Rewards in Online Bipartite Matching
by: Udwani, Rajan
Published: (2023)

A Markovian Approach for Cross-Category Complementarity in Choice Modeling
by: Housni, Omar El, et al.
Published: (2025)

Optimality of Non-Adaptive Algorithms in Online Submodular Welfare Maximization with Stochastic Outcomes
by: Udwani, Rajan
Published: (2024)

Adwords with Unknown Budgets and Beyond
by: Udwani, Rajan
Published: (2021)

Stay or Switch: Competitive Online Algorithms for Energy Plan Selection in Energy Markets with Retail Choice
by: Zhai, Jianing, et al.
Published: (2019)

Optimization in Sanger Sequencing
by: Carpente, Luisa, et al.
Published: (2024)

Optimization of Next-Day Delivery Coverage using Constraint Programming and Random Key Optimizers
by: Brubaker, Kyle, et al.
Published: (2025)

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

Almost Tight Bounds for Online Hypergraph Matching
by: Tröbst, Thorben, et al.
Published: (2024)

Extracting Dual Solutions via Primal Optimizers
by: Carmon, Yair, et al.
Published: (2024)

Isotropic Noise in Stochastic and Quantum Convex Optimization
by: Marsden, Annie, et al.
Published: (2025)

Quasi-Self-Concordant Optimization with Lewis Weights
by: Ene, Alina, et al.
Published: (2025)

Improved Approximation Guarantees and Hardness Results for MNL-Driven Product Ranking
by: Segev, Danny, et al.
Published: (2025)

Balancing Gradient and Hessian Queries in Non-Convex Optimization
by: Adil, Deeksha, et al.
Published: (2025)

Optimizing for Fairness in Generalized Kidney Exchange: Theory and Computations
by: Chang, Claire, et al.
Published: (2026)

Optimized methods for composite optimization: a reduction perspective
by: Bok, Jinho, et al.
Published: (2025)

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

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

Scalable First-Order Interior Point Trust Region Algorithms for Linearly Constrained Optimization
by: Su, Yuexin, et al.
Published: (2026)

Online Rack Placement in Large-Scale Data Centers: Online Sampling Optimization and Deployment
by: Baxi, Saumil, et al.
Published: (2025)

Dynamic Resource Allocation: Algorithmic Design Principles and Spectrum of Achievable Performances
by: Besbes, Omar, et al.
Published: (2022)

Active Learning for Non-Parametric Choice Models
by: Susan, Fransisca, et al.
Published: (2022)

Recursive Modified Pattern Search on High-dimensional Simplex : A Blackbox Optimization Technique
by: Das, Priyam
Published: (2016)

Asymptotically Optimal Competitive Ratio for Online Allocation of Reusable Resources
by: Goyal, Vineet, et al.
Published: (2020)

A Black-Box Approach for Exogenous Replenishment in Online Resource Allocation
by: Kang, Suho, et al.
Published: (2025)

Labeling Methods for Partially Ordered Paths
by: Euler, Ricardo, et al.
Published: (2023)

Sparse Submodular Function Minimization
by: Graur, Andrei, et al.
Published: (2023)

A First Order Method for Linear Programming Parameterized by Circuit Imbalance
by: Cole, Richard, et al.
Published: (2023)

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

Dynamic Pricing for Reusable Resources: The Power of Two Prices
by: Balseiro, Santiago R., et al.
Published: (2023)

Continuous Non-monotone DR-submodular Maximization with Down-closed Convex Constraint
by: Chen, Shengminjie, et al.
Published: (2023)

Dynamic Batching of Online Arrivals to Leverage Economies of Scale
by: Bhimaraju, Akhil, et al.
Published: (2023)

Entropy Regularization and Faster Decremental Matching in General Graphs
by: Chen, Jiale, et al.
Published: (2023)

Parameterized algorithms for block-structured integer programs with large entries
by: Cslovjecsek, Jana, et al.
Published: (2023)

New Sequence-Independent Lifting Techniques for Cutting Planes and When They Induce Facets
by: Prasad, Siddharth, et al.
Published: (2024)

(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs
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)