Last update: Sat Jan 6 02:13:50 MST 2018
Top |
Symbols |
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{Sofge:2002:ECA,
author = "Donald Sofge and Alan Schultz and Kenneth De Jong",
title = "Evolutionary Computational Approaches to Solving the
Multiple Traveling Salesman Problem Using a
Neighborhood Attractor Schema",
journal = j-LECT-NOTES-COMP-SCI,
volume = "2279",
pages = "153--??",
year = "2002",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Tue Sep 10 19:09:09 MDT 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t2279.htm;
http://www.math.utah.edu/pub/tex/bib/lncs2002a.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/2279/22790153.htm;
http://link.springer-ny.com/link/service/series/0558/papers/2279/22790153.pdf",
acknowledgement = ack-nhfb,
}
Related entries
- Approach,
2222(0)151,
2265(0)1,
2265(0)378,
2266(0)239,
2266(0)327,
2268(0)18,
2278(0)202,
2278(0)288,
2279(0)41,
2279(0)72,
2280(0)52,
2287(0)15,
2287(0)317,
2289(0)209,
2289(0)308,
2289(0)451,
2290(0)264,
2299(0)165,
2301(0)22,
2301(0)360,
2302(0)143,
2304(0)46,
2304(0)325,
2305(0)194,
2306(0)1,
2306(0)159,
2306(0)279,
2308(0)97,
2309(0)33,
2309(0)239,
2311(0)166,
2311(0)232,
2313(0)51,
2313(0)176,
2313(0)331,
2314(0)175,
2316(0)74,
2318(0)170,
2319(0)334,
2319(0)336,
2321(0)181,
2322(0)198,
2322(0)323,
2323(0)174,
2326(0)16,
2328(0)79,
2328(0)115,
2328(0)194,
2328(0)572,
2328(0)626,
2329(0)127,
2329(0)196,
2329(0)286,
2329(0)920
- Computational,
2277(0)63,
2278(0)182,
2281(0)140,
2281(0)426,
2281(0)459,
2285(0)372,
2286(0)4,
2289(0)120,
2293(0)65,
2308(0)494,
2309(0)162,
2326(0)69,
2327(0)539,
2328(0)797,
2329(0)186,
2329(0)216,
2329(0)503,
2329(0)513,
2329(0)723,
2329(0)743,
2329(0)1020
- Evolutionary,
2278(0)131,
2278(0)202,
2279(0)41,
2279(0)82,
2279(0)183,
2279(0)233,
2279(0)292,
2289(0)62,
2310(0)77,
2310(0)117,
2310(0)128,
2310(0)143,
2310(0)205,
2310(0)231,
2310(0)281,
2310(0)295,
2310(0)338,
2313(0)204,
2328(0)477,
2328(0)652,
2328(0)833,
2329(0)513
- Multiple,
2238(0)25,
2286(0)539,
2287(0)215,
2287(0)646,
2292(0)1,
2299(0)179,
2316(0)181,
2327(0)49,
2327(0)329,
2328(0)115
- Neighborhood,
2301(0)124,
2328(0)185
- problem,
2277(0)63,
2277(0)145,
2279(0)11,
2279(0)51,
2279(0)61,
2279(0)82,
2279(0)112,
2279(0)132,
2279(0)143,
2279(0)173,
2280(0)415,
2285(0)154,
2285(0)262,
2285(0)513,
2285(0)620,
2286(0)4,
2286(0)105,
2286(0)118,
2286(0)165,
2286(0)263,
2286(0)508,
2286(0)554,
2286(0)613,
2287(0)627,
2289(0)134,
2295(0)175,
2297(0)281,
2301(0)372,
2302(0)157,
2304(0)111,
2308(0)18,
2308(0)42,
2308(0)325,
2310(0)180,
2310(0)295,
2313(0)89,
2317(0)236,
2317(0)264,
2318(0)148,
2318(0)241,
2321(0)23,
2321(0)88,
2322(0)198,
2322(0)268,
2326(0)103,
2328(0)79,
2328(0)194,
2328(0)236,
2328(0)387,
2328(0)395,
2328(0)643,
2328(0)663,
2328(0)679,
2328(0)778,
2328(0)789,
2328(0)797,
2328(0)833,
2328(0)851,
2329(0)286,
2329(0)335,
2329(0)345,
2329(0)468,
2329(0)623,
2329(0)673,
2329(0)733,
2329(0)853,
2329(0)862,
2329(0)881,
2329(0)900
- Salesman,
2313(0)89
- Schema,
2265(0)451,
2287(0)712,
2292(0)198,
2294(0)65
- Solving,
2279(0)82,
2279(0)132,
2281(0)19,
2289(0)90,
2309(0)117,
2313(0)242,
2317(0)236,
2328(0)236,
2328(0)437,
2328(0)446,
2328(0)466,
2328(0)643,
2329(0)533,
2329(0)673,
2329(0)813,
2329(0)853,
2329(0)862,
2329(0)881
- Traveling,
2313(0)89