"Quasi-polynomial time approximation schemes for assortment optimization ..."

Alon Rieger, Danny Segev (2024)

> Home

Details and statistics

DOI: 10.1007/S10107-023-02033-4

access: closed

type: Journal Article

metadata version: 2024-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mp/RiegerS24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mp/RiegerS24
Alon Rieger, Danny Segev:
Quasi-polynomial time approximation schemes for assortment optimization under Mallows-based rankings. Math. Program. 208(1): 111-171 (2024)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.