Entry Rajasekaran:1992:NAP from tcs1990.bib
Last update: Wed Sep 26 02:11:46 MDT 2018
Top |
Symbols |
Numbers |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Rajasekaran:1992:NAP,
author = "S. Rajasekaran and J. H. Reif",
title = "Nested annealing: a provable improvement to simulated
annealing",
journal = j-THEOR-COMP-SCI,
volume = "99",
number = "1",
pages = "157--176",
day = "01",
month = jun,
year = "1992",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:24:22 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
acknowledgement = ack-nhfb,
classification = "C1180 (Optimisation techniques); C4240 (Programming
and algorithm theory)",
corpsource = "Aiken Comput. Lab., Harvard Univ., Cambridge, MA,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algorithm theory; computational complexity;
multivariate global optimization; nested annealing;
NP-complete problems; randomized algorithms; simulated
annealing",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- annealing,
102(2)253
- C1180,
84(1)77,
92(1)49,
92(1)181,
94(2)175,
97(1)105,
97(1)175,
102(1)185,
102(2)253,
106(2)361,
107(1)145,
110(1)215,
123(1)9,
125(1)17,
128(1)179,
129(2)323,
130(1)73,
132(1)347,
133(1)85,
133(1)105,
134(2)263
- complete, NP-,
80(2)203,
81(1)49,
81(1)65,
81(1)155,
81(2)257,
84(1)23,
84(2)179,
85(1)205,
92(1)145,
104(2)185,
104(2)285,
108(2)365,
119(2)293,
120(2)311,
129(1)95,
129(2)309,
131(2)361,
131(2)449,
131(2)463,
132(1)229,
133(1)85,
133(1)95,
133(2)421,
134(1)209,
134(2)263,
134(2)287,
134(2)387,
135(1)155,
135(2)361,
120(2)311,
135(1)155
- global,
74(1)3,
75(3)263,
80(1)77,
94(2)175,
119(1)23,
124(1)41,
126(1)3,
133(1)65
- improvement,
73(2)121
- multivariate,
84(2)151
- nested,
87(2)263,
127(1)149
- NP-complete,
80(2)203,
81(1)49,
81(1)65,
81(1)155,
81(2)257,
84(1)23,
84(2)179,
85(1)205,
92(1)145,
104(2)185,
104(2)285,
108(2)365,
119(2)293,
120(2)311,
129(1)95,
129(2)309,
131(2)361,
131(2)449,
131(2)463,
132(1)229,
133(1)85,
133(1)95,
133(2)421,
134(1)209,
134(2)263,
134(2)287,
134(2)387,
135(1)155,
135(2)361
- optimisation,
76(1)143,
84(1)77,
92(1)49,
92(1)181,
94(2)175,
97(1)105,
97(1)175,
102(1)185,
102(2)253,
104(2)285,
106(2)361,
107(1)145,
110(1)215,
123(1)9,
125(1)17,
128(1)179,
129(2)323,
130(1)73,
132(1)347,
133(1)85,
133(1)105,
134(2)263,
134(2)559
- optimization,
71(2)265,
76(1)143,
80(2)303,
81(2)317,
82(1)1,
84(1)77,
84(2)179,
90(1)17,
90(1)61,
94(2)175,
97(1)105,
104(2)285,
107(1)3,
107(1)145,
116(1)59,
118(2)231,
123(1)9,
125(1)17,
128(1)179,
134(2)493
- randomized,
81(2)237,
83(2)275,
97(2)199,
100(1)157,
107(1)63,
107(1)135,
112(2)339,
130(1)17,
130(1)73,
130(1)85,
130(1)101,
130(1)163
- simulated,
102(2)253