Danny Segev

Math. Program., November, 2024

Improved Approximation Guarantees for Joint Replenishment in Continuous Time.

[BibT_eX]

[DOI]

CoRR, 2024

2023

Technical Note - An Approximate Dynamic Programming Approach to the Incremental Knapsack Problem.

[BibT_eX]

[DOI]

Oper. Res., July, 2023

The Stability of MNL-Based Demand Under Dynamic Customer Substitution and Its Algorithmic Implications.

[BibT_eX]

[DOI]

Oper. Res., July, 2023

The Exponomial Choice Model for Assortment Optimization: An Alternative to the MNL Model?

[BibT_eX]

[DOI]

Jacob B. Feldman

Manag. Sci., May, 2023

Approximation algorithms for the generalized incremental knapsack problem.

[BibT_eX]

[DOI]

Yuri Faenza

Lingyi Zhang

Math. Program., March, 2023

The Continuous-Time Joint Replenishment Problem: ε-Optimal Policies via Pairwise Alignment.

[BibT_eX]

[DOI]

CoRR, 2023

2022

A Polynomial-Time Approximation Scheme for Sequential Batch Testing of Series Systems.

[BibT_eX]

[DOI]

Yaron Shaposhnik

Oper. Res., 2022

Technical Note - Approximation Schemes for Capacity-Constrained Assortment Optimization Under the Nested Logit Model.

[BibT_eX]

[DOI]

Oper. Res., 2022

Technical Note - The Multinomial Logit Model with Sequential Offerings: Algorithmic Frameworks for Product Recommendation Displays.

[BibT_eX]

[DOI]

Jacob B. Feldman

Oper. Res., 2022

A Constructive Prophet Inequality Approach to The Adaptive ProbeMax Problem.

[BibT_eX]

[DOI]

Guillermo Gallego

CoRR, 2022

Near-Optimal Adaptive Policies for Serving Stochastically Departing Customers.

[BibT_eX]

[DOI]

CoRR, 2022

2021

Display Optimization for Vertically Differentiated Locations Under Multinomial Logit Preferences.

[BibT_eX]

[DOI]

Manag. Sci., 2021

Mallows-Smoothed Distribution over Rankings Approach for Modeling Choice.

[BibT_eX]

[DOI]

Oper. Res., 2021

Efficient Approximation Schemes for Stochastic Probing and Prophet Problems.

[BibT_eX]

[DOI]

Sahil Singla

Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

2020

Constrained Assortment Optimization Under the Markov Chain-based Choice Model.

[BibT_eX]

[DOI]

Manag. Sci., 2020

An Approximate Dynamic Programming Approach to The Incremental Knapsack Problem.

[BibT_eX]

[DOI]

CoRR, 2020

The Approximability of Multiple Facility Location on Directed Networks with Random Arc Failures.

[BibT_eX]

[DOI]

Algorithmica, 2020

2019

A polynomial-time approximation scheme for the airplane refueling problem.

[BibT_eX]

[DOI]

J. Sched., 2019

The ordered k-median problem: surrogate models and approximation algorithms.

[BibT_eX]

[DOI]

Math. Program., 2019

Approximation Algorithms for Dynamic Assortment Optimization Models.

[BibT_eX]

[DOI]

Retsef Levi

Math. Oper. Res., 2019

Scheduling Promotion Vehicles to Boost Profits.

[BibT_eX]

[DOI]

Manag. Sci., 2019

Assortment Planning with Nested Preferences: Dynamic Programming with Distributions as States?

[BibT_eX]

[DOI]

Algorithmica, 2019

Online Algorithms for Maximum Cardinality Matching with Edge Arrivals.

[BibT_eX]

[DOI]

Niv Buchbinder

Yevgeny Tkach

Algorithmica, 2019

2018

Greedy-Like Algorithms for Dynamic Assortment Planning Under Multinomial Logit Preferences.

[BibT_eX]

[DOI]

Retsef Levi

Oper. Res., 2018

The Approximability of Assortment Optimization Under Ranking Preferences.

[BibT_eX]

[DOI]

Oper. Res., 2018

Improved bounds for randomized preemptive online matching.

[BibT_eX]

[DOI]

Inf. Comput., 2018

2017

A Sublogarithmic Approximation for Tollbooth Pricing on Trees.

[BibT_eX]

[DOI]

Math. Oper. Res., 2017

The Approximability of Partial Vertex Covers in Trees.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2017: Theory and Practice of Computer Science, 2017

2016

Near-Optimal Algorithms for the Assortment Planning Problem Under Dynamic Substitution and Stochastic Demand.

[BibT_eX]

[DOI]

Vineet Goyal

Retsef Levi

Oper. Res., 2016

Assortment Optimization under a Random Swap based Distribution over Permutations Model.

[BibT_eX]

[DOI]

Antoine Désir

Vineet Goyal

Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

Assortment Optimization Under the Mallows model.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

2014

An Approximate Dynamic-Programming Approach to the Joint Replenishment Problem.

[BibT_eX]

[DOI]

Math. Oper. Res., 2014

Mobile facility location: combinatorial filtering via weighted occupancy.

[BibT_eX]

[DOI]

Amitai Armon

J. Comb. Optim., 2014

2013

Approximation algorithms for orienting mixed graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

The Approximability of Shortest Path-Based Graph Orientations of Protein-Protein Interaction Networks.

[BibT_eX]

[DOI]

Dima Blokh

Roded Sharan

J. Comput. Biol., 2013

Improved Bounds for Online Preemptive Matching.

[BibT_eX]

[DOI]

Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

2012

Approximation Algorithms and Hardness Results for Shortest Path Based Graph Orientations.

[BibT_eX]

[DOI]

Dima Blokh

Roded Sharan

Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

2011

Set connectivity problems in undirected graphs and the directed steiner network problem.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2011

Improved Approximation Guarantees for Weighted Matching in the Semi-streaming Model.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2011

Approximating <i>k</i>-generalized connectivity via collapsing HSTs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2011

On the Approximability of Reachability-Preserving Network Orientations.

[BibT_eX]

[DOI]

Michael Elberfeld

Vineet Bafna

Alexander Medvedovsky

Internet Math., 2011

A Unified Approach to Approximating Partial Covering Problems.

[BibT_eX]

[DOI]

Jochen Könemann

Ojas Parekh

Algorithmica, 2011

2010

A polylogarithmic approximation for computing non-metric terminal Steiner trees.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2010

Approximate <i>k</i>-Steiner Forests via the Lagrangian Relaxation Technique with Internal Preprocessing.

[BibT_eX]

[DOI]

Gil Segev

Algorithmica, 2010

The Complexity of Bottleneck Labeled Graph Problems.

[BibT_eX]

[DOI]

Jérôme Monnot

Algorithmica, 2010

Improved Orientations of Physical Networks.

[BibT_eX]

[DOI]

Roded Sharan

Proceedings of the Algorithms in Bioinformatics, 10th International Workshop, 2010

A Sublogarithmic Approximation for Highway and Tollbooth Pricing.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2009

Improved online algorithms for the sorting buffer problem on line metrics.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2009

Scheduling with Outliers.

[BibT_eX]

[DOI]

Anupam Gupta

Ravishankar Krishnaswamy

Amit Kumar

Proceedings of the Approximation, 2009

2008

Rounding to an integral program.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2008

Path Hitting in Acyclic Graphs.

[BibT_eX]

[DOI]

Ojas Parekh

Algorithmica, 2008

2007

Approximation algorithms for NP-hard problems in combinatorial optimization

[BibT_eX]

[DOI]

PhD thesis, 2007

Approximation algorithms and hardness results for labeled connectivity problems.

[BibT_eX]

[DOI]

Jérôme Monnot

J. Comb. Optim., 2007

Improved Online Algorithms for the Sorting Buffer Problem.

[BibT_eX]

[DOI]

Proceedings of the STACS 2007, 2007

Bi-criteria linear-time approximations for generalized k-mean/median/center.

[BibT_eX]

[DOI]

Proceedings of the 23rd ACM Symposium on Computational Geometry, 2007

2006

Partial multicuts in trees.

[BibT_eX]

[DOI]

Asaf Levin

Theor. Comput. Sci., 2006

Robust subgraphs for trees and paths.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2006

2005

The Multi-radius Cover Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005

The Set Cover with Pairs Problem.

[BibT_eX]

[DOI]