Items where Subject is "A > Approximations"

Up a level
Export as [feed] Atom [feed] RSS
Group by: Creators | Item Type
Jump to: A
Number of items at this level: 4.

A

Aouad, A, Farias, V, Levi, R and Segev, D (2018) The approximability of assortment optimization under ranking preferences. Operations Research, 66 (6). pp. 1661-1669. ISSN 0030-364X OPEN ACCESS

Aouad, A, Levi, R and Segev, D (2019) Approximation algorithms for dynamic assortment optimization models. Mathematics of Operations Research, 44 (2). pp. 487-511. ISSN 0364-765X OPEN ACCESS

Aouad, A, Levi, R and Segev, D (2018) Greedy-like algorithms for dynamic assortment planning under multinomial logit preferences. Operations Research, 66 (5). pp. 1321-1345. ISSN 0030-364X OPEN ACCESS

Aouad, A and Segev, D (2019) The ordered k-median problem: surrogate models and approximation algorithms. Mathematical Programming, 177 (1-2). pp. 55-83. ISSN 0025-5610 OPEN ACCESS

This list was generated on Tue Oct 27 01:03:22 2020 GMT.
LBS Research Online is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.