Cover Image

Assortment optimization given basket shopping behavior using the Ising model

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Vasilyev, Andrey, Maier, Sebastian, Seifert, Ralf W.
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Fair Assortment Planning
by: Chen, Qinyi, et al.
Published: (2022)

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

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

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

Convex optimization with $p$-norm oracles
by: Adil, Deeksha, et al.
Published: (2024)

No quantum advantage implies improved bounds and classical algorithms for the binary paint shop problem
by: Goh, Mark, et al.
Published: (2026)

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

A nearly optimal randomized algorithm for explorable heap selection
by: Borst, Sander, et al.
Published: (2022)

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

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

Availability is all you need: achieving optimal regret with minimal information for dynamic matching
by: Kerimov, Süleyman, 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)

Quantum speedups for stochastic optimization
by: Sidford, Aaron, et al.
Published: (2023)

Expanding the reach of quantum optimization with fermionic embeddings
by: Zhao, Andrew, et al.
Published: (2023)

(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs
by: Hunkenschröder, Christoph, et al.
Published: (2025)

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

Radial Isotropic Position via an Implicit Newton's Method
by: Jambulapati, Arun, et al.
Published: (2025)

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

Deriving the Gradients of Some Popular Optimal Transport Algorithms
by: Xie, Fangzhou
Published: (2025)

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

A Faster Parametric Search for the Integral Quickest Transshipment Problem
by: Anapolska, Mariia, et al.
Published: (2025)

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

An Efficient Frequency-Based Approach for Maximal Square Detection in Binary Matrices
by: Bhandari, Swastik
Published: (2025)

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

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

Is Zadeh's Least-Entered Pivot Rule Exponential?
by: Zadeh, Norman
Published: (2025)

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

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

An Efficient Algorithm for Minimizing Ordered Norms in Fractional Load Balancing
by: Blankenburg, Daniel, et al.
Published: (2025)

Improved $\ell_{p}$ Regression via Iteratively Reweighted Least Squares
by: Ene, Alina, et al.
Published: (2025)

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

Bayesian Optimal Stopping with Maximum Value Knowledge
by: Kleer, Pieter, et al.
Published: (2025)

Adaptive Matrix Sparsification and Applications to Empirical Risk Minimization
by: Liu, Yang P., et al.
Published: (2025)

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

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

A Variational-Calculus Approach to Online Algorithm Design and Analysis
by: Xu, Pan
Published: (2025)

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

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

TSP integrality gap via 2-edge-connected multisubgraph problem under coincident IP optima
by: Yamanaka, Toshiaki
Published: (2025)

Breaking the Barrier of Self-Concordant Barriers: Faster Interior Point Methods for M-Matrices
by: Vladu, Adrian
Published: (2025)