147 search results - page 2 / 30 » The Uncapacitated Swapping Problem |
STOC
2005
ACM
14 years 6 months ago
2005
ACM
In combinatorial optimization, a popular approach to NP-hard problems is the design of approximation algorithms. These algorithms typically run in polynomial time and are guarante...
EPIA
2007
Springer
13 years 11 months ago
2007
Springer
Research in the field of examination timetabling has developed in two directions. The first looks at applying various methodologies to induce examination timetables. The second tak...
JMLR
2010
13 years 12 days ago
2010
The Uncapacitated Facility Location Problem (UFLP) is one of the most widely studied discrete location problems, whose applications arise in a variety of settings. We tackle the U...
EOR
2006
13 years 5 months ago
2006
We present a multistart heuristic for the uncapacitated facility location problem, based on a very successful method we originally developed for the p-median problem. We show exte...
PATAT
2004
Springer
13 years 11 months ago
2004
Springer
A hybrid Multi-Objective Evolutionary Algorithm is used to tackle the uncapacitated exam proximity problem. In this hybridization, local search operators are used instead of the tr...