3367 search results - page 212 / 674 » Incremental assignment problem |
121
Voted
STACS
2010
Springer
15 years 10 months ago
2010
Springer
In the uncapacitated facility location problem, given a graph, a set of demands and opening costs, it is required to find a set of facilities R, so as to minimize the sum of the c...
129
Voted
SOFSEM
2007
Springer
15 years 9 months ago
2007
Springer
The problem of finding k minimum energy, edge-disjoint paths in wireless networks (MEEP) arises in the context of routing and belongs to the class of range assignment problems. A ...
119
Voted
CP
2005
Springer
15 years 9 months ago
2005
Springer
Conditional symmetry arises in a sub-problem of a constraint satisfaction problem, where the sub-problem satisfies some condition under which additional symetries hold. Typically...
131
Voted
EVOW
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. The quadratic assignment problem arises in a variety of practical settings. It is known to be among the hardest combinatorial problems for exact algorithms. Therefore, a ...
111
click to vote
ISCAS
2002
IEEE
15 years 8 months ago
2002
IEEE
We address the problem of checking the routability of segmented channels using satisfiability. The segmented channel routing problem arises in the context of row-based field progr...