86 search results - page 2 / 18 » Simulated Annealing for Grid Scheduling Problem |
CEC
2003
IEEE
13 years 10 months ago
2003
IEEE
Abstract- Simulated annealing (SA) is an effective general heuristic method for solving many combinatorial optimization problems. This paper deals with two problems in SA. One is ...
COR
2008
13 years 5 months ago
2008
In this paper, an improved Two-Stage Simulated Annealing algorithm is presented for the Minimum Linear Arrangement Problem for Graphs. This algorithm integrates several distinguis...
FOCS
2007
IEEE
13 years 11 months ago
2007
IEEE
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...
CPAIOR
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. This paper considers all the variants of the traveling tournament prob) proposed in [17, 7] to abstract the salient features of major league baseball (MLB) in the United ...
CP
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. In this paper we propose an optimal anytime version of constrained simulated annealing (CSA) for solving constrained nonlinear programming problems (NLPs). One of the goa...