Entry Angel:1998:ACG from tcs1995.bib
Last update: Sun Oct 15 02:56:11 MDT 2017
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{Angel:1998:ACG,
author = "E. Angel and V. Zissimopoulos",
title = "Autocorrelation coefficient for the graph
bipartitioning problem",
journal = j-THEOR-COMP-SCI,
volume = "191",
number = "1--2",
pages = "229--243",
day = "30",
month = jan,
year = "1998",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:21:31 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1998&volume=191&issue=1-2;
http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
URL = "http://www.elsevier.com/cas/tree/store/tcs/sub/1998/191/1-2/2712.pdf",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C1180
(Optimisation techniques); C4240 (Programming and
algorithm theory)",
corpsource = "Lab. de Recherche en Inf., Univ. de Paris-Sud, Orsay,
France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "approximate solution; autocorrelation coefficient;
combinatorial optimization; computability; cost
function; edge-weighted graph; graph bipartitioning;
graph theory; local search; neighborhood structure;
NP-hard optimization; optimisation; quality solutions;
search problems; simulated annealing; tabu search",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- annealing,
215(1)51
- approximate,
145(1)271,
149(1)129,
150(1)1,
161(1)307,
172(1)91,
173(1)113,
179(1)319,
181(1)159,
188(1)79,
201(1)263,
203(1)151,
210(2)341,
219(1)185
- C1180,
137(2)253,
138(1)3,
146(1)69,
146(1)269,
147(1)181,
147(1)267,
148(1)33,
148(2)325,
150(1)1,
156(1)217,
157(2)215,
158(1)117,
158(1)279,
162(2)225,
162(2)323,
164(1)1,
164(1)59,
172(1)265,
173(1)3,
174(1)23,
179(1)251,
182(1)217,
188(1)129,
188(1)221,
191(1)193,
194(1)207,
196(1)365,
197(1)245-2
- coefficient,
161(1)69,
172(1)255,
188(1)45,
218(1)143
- computability,
137(1)129,
139(1)243,
142(1)27,
145(1)111,
147(1)31,
153(1)49,
154(2)145,
155(1)277,
157(1)79,
157(1)91,
157(2)267,
160(1)365,
161(1)109,
161(1)289,
162(1)5,
162(1)23,
162(1)45,
162(1)117,
163(1)177,
165(1)133,
166(1)147,
168(2)241,
168(2)461,
171(1)3,
172(1)233,
174(1)137,
175(1)183,
175(2)349,
181(1)195,
184(1)195,
190(2)279,
191(1)145,
192(2)315,
193(1)149,
194(1)219,
194(1)247-1,
195(2)183,
210(1)73,
219(1)65,
219(1)185,
219(1)287,
219(1)421,
219(1)467,
219(1)487,
224(1)173
- cost,
144(1)199,
156(1)301,
156(1)315,
164(1)185,
165(2)441,
168(1)21,
173(1)113,
181(1)75,
182(1)203,
182(1)233,
194(1)207,
196(1)241,
219(1)301
- hard, NP-,
162(2)225,
169(1)23
- local,
138(1)141,
138(2)391,
144(1)67,
145(1)95,
147(1)1,
148(2)261,
151(2)487,
153(1)129,
154(2)329,
155(2)349,
155(2)439,
163(1)303,
168(1)155,
172(1)265,
173(1)89,
173(1)235,
173(1)283,
178(1)275,
183(2)229,
186(1)199,
187(1)7,
187(1)87,
192(2)233,
194(1)245,
195(1)33,
197(1)245-2,
204(1)87,
205(1)297,
220(1)247
- neighborhood,
168(2)337,
172(1)209
- NP-hard,
143(1)93,
143(1)113,
147(1)181,
161(1)123,
162(2)225,
169(1)23,
181(2)379,
197(1)171
- optimisation,
137(2)253,
138(1)3,
146(1)69,
146(1)269,
147(1)181,
147(1)267,
148(1)33,
148(2)325,
150(1)1,
156(1)217,
157(2)215,
158(1)117,
158(1)279,
162(2)225,
162(2)323,
164(1)1,
164(1)59,
172(1)265,
173(1)3,
174(1)23,
179(1)251,
182(1)217,
188(1)129,
188(1)221,
191(1)193,
194(1)207,
196(1)365,
197(1)245-2
- optimization,
142(1)27,
144(1)125,
145(1)189,
146(1)69,
146(1)145,
146(1)269,
147(1)181,
150(1)1,
156(1)217,
157(2)215,
158(1)117,
158(1)279,
173(1)3,
173(1)113,
174(1)23,
180(1)269,
187(1)231,
193(1)149,
194(1)207,
196(1)365,
207(1)203,
209(1)107,
227(1)299
- search,
137(2)253,
144(1)101,
144(1)161,
144(1)199,
144(1)251,
146(1)199,
147(1)19,
148(2)325,
154(2)225,
156(1)39,
156(1)315,
163(1)117,
164(1)1,
164(1)141,
164(1)185,
167(1)95,
168(1)21,
172(1)265,
181(1)119,
182(1)217,
188(1)1,
188(1)221,
197(1)245-2,
203(1)51,
205(1)243,
229(1)103
- simulated,
165(2)463,
215(1)51
- solution,
145(1)71,
148(1)67,
150(1)1,
155(1)267,
157(1)115,
161(1)93,
161(1)307,
168(1)121,
168(2)367,
173(1)3,
173(1)113,
178(1)265,
181(2)379,
187(1)27,
205(1)307,
215(1)1,
216(1)395,
225(1)171
- Zissimopoulos, V.,
178(1)265