113 search results - page 15 / 23 » On solving a hard quadratic 3-dimensional assignment problem |
101
click to vote
CONSTRAINTS
2006
14 years 11 months ago
2006
We combine mixed integer linear programming (MILP) and constraint programming (CP) to minimize tardiness in planning and scheduling. Tasks are allocated to facilities using MILP an...
CCCG
2004
15 years 14 days ago
2004
We study the problem of computing the set of all distant horizons of a terrain, represented as either: the set of all edges that appear in the set of all distant horizons; the con...
78
Voted
TCS
2008
14 years 11 months ago
2008
We study a problem of scheduling client requests to servers. Each client has a particular latency requirement at each server and may choose either to be assigned to some server in ...
103
click to vote
FGR
2006
IEEE
15 years 2 months ago
2006
IEEE
A global approach to hand gesture vocabulary design is proposed which includes human as well as technical design factors. The human centered desires of multiple users are implicit...
70
Voted
AAAI
1994
15 years 12 days ago
1994
It has recently been shown that local search is surprisingly good at nding satisfying assignments for certain computationally hard classes of CNF formulas. The performance of basi...