Login / Signup

Solving hard control problems in voting systems via integer programming.

Sergey PolyakovskiyRudolf BerghammerFrank Neumann
Published in: Eur. J. Oper. Res. (2016)
Keyphrases
  • integer programming
  • control problems
  • optimal control
  • np hard
  • column generation
  • solving hard
  • special case
  • linear programming
  • traveling salesman problem
  • propositional logic
  • cutting plane
  • cutting plane algorithm