Randomized algorithms for lexicographic inference
Year of publication: |
2019
|
---|---|
Authors: | Kohli, Rajeev ; Boughanmi, Khaled ; Kohli, Vikram |
Published in: |
Operations research. - Catonsville, MD : INFORMS, ISSN 0030-364X, ZDB-ID 123389-0. - Vol. 67.2019, 2, p. 357-375
|
Subject: | lexicographic rules | noncompensatory choice | consumer search | discrete optimization | randomized algorithms | analysis of algorithms | maximum likelihood | Theorie | Theory | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming |
-
FAST : fast algorithm for the scenario technique
Carè, Algo, (2014)
-
Optimal pricing with a single point
Allouah, Amine, (2023)
-
Constrained resource assignments : fast algorithms and applications in wireless networks
Berger, André, (2016)
- More ...
-
Framing, Context and Value Averaging
Boughanmi, Khaled, (2018)
-
Hit or Fit : The Tradeoff between Maximizing Likelihood and Hit Rate
Boughanmi, Khaled, (2022)
-
Dynamics of musical success : a machine learning approach for multimedia data fusion
Boughanmi, Khaled, (2021)
- More ...