3367 search results - page 212 / 674 » Incremental assignment problem |
156
click to vote
STACS
2010
Springer
16 years 1 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...
171
click to vote
SOFSEM
2007
Springer
16 years 15 days 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 ...
158
click to vote
CP
2005
Springer
15 years 12 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...
169
click to vote
EVOW
2004
Springer
15 years 11 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 ...
152
click to vote
ISCAS
2002
IEEE
15 years 11 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...