Sciweavers

3 search results - page 1 / 1
» Bribery in Voting Over Combinatorial Domains Is Easy
Sort
View
ISAIM
2012
166views more  ISAIM 2012»
12 years 26 days ago
Bribery in Voting Over Combinatorial Domains Is Easy
Nicholas Mattei, Maria Silvia Pini, Francesca Ross...
IJCAI
2007
13 years 6 months ago
Vote and Aggregation in Combinatorial Domains with Structured Preferences
In many real-world collective decision problems, the set of alternatives is a Cartesian product of finite value domains for each of a given set of variables. The prohibitive size...
Jérôme Lang
WEA
2010
Springer
289views Algorithms» more  WEA 2010»
14 years 3 days ago
Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs
Abstract We report on experiments with turning the branch-price-andcut framework SCIP into a generic branch-price-and-cut solver. That is, given a mixed integer program (MIP), our ...
Gerald Gamrath, Marco E. Lübbecke