306 search results - page 9 / 62 » On the Minimal Uncompletable Word Problem |
HEURISTICS
2000
13 years 7 months ago
2000
This paper examines a network design problem that arises in the telecommunications industry. In this problem, communication between a gateway vertex and a number of demand vertice...
SIAMNUM
2010
13 years 2 months ago
2010
In the solution of Fluid-Structure Interaction problems, partitioned procedures are modular algorithms that involve separate fluid and structure solvers, that interact, in an itera...
IJAIT
2007
13 years 7 months ago
2007
In this paper, we study the unrelated parallel machine problem for minimizing the makespan, which is NP-hard. We used Simulated Annealing (SA) and Tabu Search (TS) with Neighborho...
FOCM
2010
13 years 6 months ago
2010
Free-discontinuity problems describe situations where the solution of interest is defined by a function and a lower dimensional set consisting of the discontinuities of the funct...
MP
2002
13 years 7 months ago
2002
Semismooth Newton methods constitute a major research area for solving mixed complementarity problems (MCPs). Early research on semismooth Newton methods is mainly on infeasible me...