14548 search results - page 358 / 2910 » The Optimal Path-Matching Problem |
203
click to vote
ICGA
1993
15 years 8 months ago
1993
A genetic algorithms is applied to find a maximum flow from the source to sink in a weighted directed graph, where the weight associated with each edge represents its flow capacit...
146
click to vote
CLASSIFICATION
2008
15 years 6 months ago
2008
Let G = (V, E, w) be a graph with vertex and edge sets V and E, respectively, and w : E IR+ a function which assigns a positive weight or length to each edge of G. G is called a r...
174
click to vote
JAIR
2008
15 years 6 months ago
2008
In a facility with front room and back room operations, it is useful to switch workers between the rooms in order to cope with changing customer demand. Assuming stochastic custom...
198
click to vote
AAIM
2006
Springer
16 years 21 days ago
2006
Springer
Abstract. We study an extension of the set cover problem, the connected set cover problem, the problem is to find a set cover of minimal size that satisfies some connectivity con...
161
click to vote
IJCGA
2006
15 years 6 months ago
2006
In this paper, we consider the optimal well-constrained completion problem, that is, for an under-constrained geometric constraint problem, add automatically new constraints in suc...