Entry Takahashi:1996:SOP 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{Takahashi:1996:SOP,
author = "Yoshikane Takahashi",
title = "Solving optimization problems with variable-constraint
by an extended {Cohen--Grossberg} model",
journal = j-THEOR-COMP-SCI,
volume = "158",
number = "1--2",
pages = "279--341",
day = "20",
month = may,
year = "1996",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:19:55 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1996&volume=158&issue=1-2;
http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1996&volume=158&issue=1-2&aid=2026",
acknowledgement = ack-nhfb,
classification = "C1180 (Optimisation techniques); C1230D (Neural
nets); C6110L (Logic programming)",
corpsource = "NTT Commun. Sci. Labs., Kanagawa, Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Cohen--Grossberg model; constraint handling;
continuous optimization problems; Hopfield model;
Liapunov function; neural nets; neural networks;
optimisation; optimization problems; traveling salesman
problem; variable constraint; variable-constraint",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- 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,
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,
191(1)229,
194(1)207,
196(1)365,
197(1)245-2
- C1230D,
134(1)51,
143(2)251,
147(1)181,
168(2)405,
168(2)461,
172(1)91,
178(1)77,
185(1)15
- C6110L,
135(1)67,
142(1)27,
142(1)59,
142(1)89,
142(1)125,
142(2)141,
146(1)243,
149(2)201,
149(2)231,
151(1)37,
155(1)157,
160(1)283,
165(1)171,
165(1)201,
166(1)101,
166(1)221,
169(1)81,
170(1)209,
170(1)383,
171(1)61,
171(1)77,
171(1)147,
173(1)3,
173(1)89,
173(1)113,
173(1)151,
173(1)183,
173(1)209,
173(1)235,
173(1)253,
173(1)283,
173(2)485,
176(1)175,
179(1)273,
182(1)183,
183(2)281,
184(1)1,
184(1)105,
185(1)47,
185(1)191,
185(2)319,
190(2)211,
190(2)241,
192(1)77,
192(1)107,
192(2)259,
193(1)149,
194(1)245-2,
197(1)247
- constraint,
138(1)211,
141(1)151,
142(1)27,
142(2)141,
151(1)37,
151(1)z,
156(1)217,
160(1)365,
166(1)101,
167(1)73,
171(1)25,
172(1)233,
173(1)3,
173(1)89,
173(1)113,
173(1)151,
173(1)183,
173(1)209,
173(1)235,
173(1)253,
173(1)283,
175(2)349,
179(1)273,
183(2)281,
184(1)195,
185(1)81,
187(1)49,
190(2)115,
190(2)151,
192(1)77,
192(1)107,
192(2)259,
192(2)315,
193(1)149,
197(1)1,
206(1)81,
206(1)257,
221(1)179,
225(1)113
- continuous,
138(1)67,
138(1)101,
138(1)141,
138(1)169,
138(1)201,
138(1)211,
144(1)251,
151(1)277,
153(1)3,
155(1)221,
159(2)355,
162(1)79,
165(2)295,
168(1)155,
176(1)89,
177(1)59,
179(1)319,
179(1)421,
193(1)53,
193(1)197,
197(1)244,
203(1)151,
227(1)275
- extended,
143(1)51,
151(1)207,
162(1)79,
164(1)123,
166(1)63,
170(1)383,
171(1)281,
173(2)445,
180(1)269,
190(1)41,
205(1)317,
206(1)1,
207(1)73
- handling,
137(2)269,
140(2)231,
141(1)53,
142(2)141,
144(1)161,
145(1)345,
147(1)19,
147(1)165,
151(1)37,
155(2)439,
157(1)35,
157(1)115,
160(1)365,
161(1)235,
163(1)145,
163(1)211,
163(1)239,
163(1)259,
164(1)73,
165(2)311,
166(1)101,
171(1)3,
171(1)221,
171(1)247,
173(1)3,
173(1)89,
173(1)113,
173(1)151,
173(1)183,
173(1)209,
173(1)235,
173(1)253,
173(1)283,
178(1)129,
179(1)273,
180(1)203,
181(1)159,
183(2)281,
187(1)105,
187(1)117,
187(1)123,
187(1)147,
187(1)203,
187(1)221,
187(1)231,
187(1)249,
187(1)263,
187(1)z,
188(1)231,
188(1)241,
190(2)115,
192(1)77,
192(1)107,
192(2)259,
193(1)149,
197(1)243
- Hopfield,
174(1)123
- neural,
134(1)51,
141(1)1,
143(2)251,
147(1)181,
156(1)217,
168(2)405,
168(2)461,
172(1)91,
174(1)123,
178(1)77,
182(1)257,
185(1)15
- 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,
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,
191(1)229,
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,
173(1)3,
173(1)113,
174(1)23,
180(1)269,
187(1)231,
191(1)229,
193(1)149,
194(1)207,
196(1)365,
207(1)203,
209(1)107,
227(1)299
- salesman,
156(1)217
- solving,
155(1)221,
156(1)217,
157(1)79,
160(1)145,
160(1)185,
173(1)183,
173(1)253,
186(1)83,
201(1)275,
224(1)215
- Takahashi, Yoshikane,
156(1)217
- traveling,
156(1)217
- variable,
138(1)113,
139(1)207,
140(2)231,
140(2)249,
140(2)301,
141(1)269,
142(1)89,
144(1)59,
144(1)125,
144(1)161,
146(1)5,
148(1)141,
149(1)101,
153(1)3,
155(1)85,
155(1)277,
155(2)411,
160(1)365,
162(1)151,
167(1)47,
167(1)95,
167(1)131,
168(1)39,
168(1)155,
169(1)81,
172(1)255,
173(1)183,
173(1)283,
178(1)129,
183(2)187,
185(2)237,
192(1)3,
192(2)201,
197(1)241,
197(1)245,
209(1)237,
217(1)157,
219(1)287,
223(1)193,
224(1)73