2393 search results - page 26 / 479 » Bounds-Consistent Local Search |
IJKESDP
2010
13 years 6 months ago
2010
—This paper considers k-minimum spanning tree problems. An existing solution algorithm based on tabu search, which was proposed by Katagiri et al., includes an iterative solving ...
PPSN
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
WOA
2010
13 years 5 months ago
2010
Maritime search and rescue operations are critical missions involving personnel, boats, helicopter, aircrafts in a struggle against time often worsened by adversary sea and weather...
AAAI
2004
13 years 9 months ago
2004
Tabu search algorithms are amongst the most successful local search based methods for the maximum satisfiability problem. The practical superiority of tabu search over the local s...
ICTAI
2009
IEEE
14 years 2 months ago
2009
IEEE
In this paper a learning based local search approach for propositional satisfiability is presented. It is based on an original adaptation of the conflict driven clause learning ...