| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1142855 | Operations Research Letters | 2006 | 7 Pages |
Abstract
This article describes a fast, easily implemented MILP algorithm which selects optimal boolean factors (called keys) for predicting the outcomes of Presidential elections in the United States. Results derived from the method support the validity and parsimony of the key-based election model offered by Lichtman and Keilis-Borok.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Dennis C. Dietz,