Abstract. We present a method for finding the boundaries between adjacent regions in an image, where “seed” areas have already been identified in the individual regions to be...
Thouis R. Jones, Anne E. Carpenter, Polina Golland
The Quadratic Assignment Problem (QAP) is a well-known NP-hard combinatorial optimization problem that is at the core of many real-world optimization problems. We prove that QAP c...
: For an infinite-horizon optimal control problem, the cost does not, in general, converge. The classical work-around to this problem is to introduce a discount or "forgetting...
Locating a facility is often modeled as either the maxisum or the minisum problem, reflecting whether the facility is undesirable (obnoxious) or desirable. But many facilities are ...
In this paper, we propose a Genetic Algorithm (GA) approach using a new paths growth procedure by the random key-based encoding for solving Shortest Path Routing (SPR) problem. An...