Sciweavers

881 search results - page 42 / 177
» Solving satisfiability problems with preferences
Sort
View
AMEC
2004
Springer
14 years 2 months ago
A Budget-Balanced, Incentive-Compatible Scheme for Social Choice
Abstract. Many practical scenarios involve solving a social choice problem: a group of self-interested agents have to agree on an outcome that best fits their combined preferences...
Boi Faltings
PATAT
2004
Springer
151views Education» more  PATAT 2004»
14 years 2 months ago
Decomposition and Parallelization of Multi-resource Timetabling Problems
The timetabling problem consists in fixing a sequence of meetings between teachers and students in a prefixed period of time (typically a week), satisfying a set of constraints of ...
Petr Slechta
CPAIOR
2010
Springer
14 years 19 hour ago
Hybrid Methods for the Multileaf Collimator Sequencing Problem
Abstract. The multileaf collimator sequencing problem is an important component of the effective delivery of intensity modulated radiotherapy used in the treatment of cancer. The p...
Hadrien Cambazard, Eoin O'Mahony, Barry O'Sullivan
IOR
2006
173views more  IOR 2006»
13 years 8 months ago
A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
In the dial-a-ride problem, users formulate requests for transportation from a specific origin to a specific destination. Transportation is carried out by vehicles providing a sha...
Jean-François Cordeau
ISAAC
2001
Springer
112views Algorithms» more  ISAAC 2001»
14 years 1 months ago
On the Complexity of Train Assignment Problems
We consider a problem faced by train companies: How can trains be assigned to satisfy scheduled routes in a cost efficient way? Currently, many railway companies create solutions b...
Thomas Erlebach, Martin Gantenbein, Daniel Hü...