A 0-1 knapsack model for evaluating the possible electoral college performance in two-party US presidential elections

DOI10.1016/j.mcm.2007.10.012zbMath1156.91468OpenAlexW2012063483MaRDI QIDQ1007645

A. S. Belen'kij

Publication date: 23 March 2009

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.mcm.2007.10.012

zbMATH Keywords

integer linear programmingKnapsack problemelectoral collegepopular voteelectoral vote

Mathematics Subject Classification ID

Integer programming (90C10) Voting theory (91B12) History, political science (91F10)

Related Items

A note on permutations and rank aggregation ⋮ A Mixed Integer Linear Program for Election Campaign Optimization Under D’Hondt Rule

Uses Software

• Knapsack

Cites Work

• Calculating the minimal fraction of the popular vote to win the U.S. presidency in the electoral college
• A minimal algorithm for the multiple-choice knapsack problem
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
• Discrete-Variable Extremum Problems