Danny Segev

19 catalog papers. Identity-linked publications and additional name matches are distinguished below.

ORCID: 0000-0003-4684-2185

School of Mathematical Sciences, Tel Aviv University, Tel Aviv 69978, Israel

Publications

• Maximum Load Assortment Optimization: Approximation Algorithms and Adaptivity Gaps — Operations Research 2026
• Near-Optimal Adaptive Policies for Serving Stochastically Departing Customers — Operations Research 2025
• The Click-Based MNL Model: A Framework for Modeling Click Data in Assortment Optimization — Management Science 2025
• The Continuous-Time Joint Replenishment Problem:ϵ-Optimal Policies via Pairwise Alignment — Management Science 2025
• Dynamic Pricing with Menu Costs: Approximation Schemes and Applications to Grocery Retail — Manufacturing & Service Operations Management 2025
• Assortment Optimization Under the Multi-Purchase Multinomial Logit Choice Model — Operations Research 2024
• The Exponomial Choice Model for Assortment Optimization: An Alternative to the MNL Model? — Management Science 2023
• The Stability of MNL-Based Demand Under Dynamic Customer Substitution and Its Algorithmic Implications — Operations Research 2023
• Technical Note—An Approximate Dynamic Programming Approach to the Incremental Knapsack Problem — Operations Research 2023
• A Polynomial-Time Approximation Scheme for Sequential Batch Testing of Series Systems — Operations Research 2022
• Technical Note—Approximation Schemes for Capacity-Constrained Assortment Optimization Under the Nested Logit Model — Operations Research 2022
• Technical Note—The Multinomial Logit Model with Sequential Offerings: Algorithmic Frameworks for Product Recommendation Displays — Operations Research 2022
• Display Optimization for Vertically Differentiated Locations Under Multinomial Logit Preferences — Management Science 2021
• Mallows-Smoothed Distribution over Rankings Approach for Modeling Choice — Operations Research 2021
• Constrained Assortment Optimization Under the Markov Chain–based Choice Model — Management Science 2020
• Scheduling Promotion Vehicles to Boost Profits — Management Science 2019
• Greedy-Like Algorithms for Dynamic Assortment Planning Under Multinomial Logit Preferences — Operations Research 2018
• The Approximability of Assortment Optimization Under Ranking Preferences — Operations Research 2018
• New Approximation Guarantees for the Inventory Staggering Problem — Operations Research