Optimal bounds for the no-show paradox via SAT solving
Year of publication: |
November 2017
|
---|---|
Authors: | Brandt, Felix ; Geist, Christian ; Peters, Dominik |
Published in: |
Mathematical social sciences. - Amsterdam [u.a.] : NH, Elsevier, ISSN 0165-4896, ZDB-ID 283230-6. - Vol. 90.2017, p. 18-27
|
Subject: | Mathematische Optimierung | Mathematical programming | Theorie | Theory |
Type of publication: | Article |
---|---|
Type of publication (narrower categories): | Konferenzbeitrag ; Conference paper ; Aufsatz in Zeitschrift ; Article in journal |
Language: | English |
Other identifiers: | 10.1016/j.mathsocsci.2016.09.003 [DOI] |
Source: | ECONIS - Online Catalogue of the ZBW |
-
Ivanov, Dmitry, (2015)
-
An improved ant algorithm for multi-mode resource constrained project scheduling problem
Wuliang, Peng, (2014)
-
Computing booking limits under a non-parametric demand model : a mathematical programming approach
Hosseinalifam, Morad, (2016)
- More ...
-
A note on the McKelvey uncovered set and Pareto optimality
Brandt, Felix, (2016)
-
Funding public projects : a case for the Nash product rule
Brandl, Florian, (2022)
-
An axiomatic characterization of the Borda mean rule
Brandl, Florian, (2019)
- More ...