Entry Weyland:2014:CCP from tcs2010.bib
Last update: Sun Mar 31 03:12:29 MDT 2019
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{Weyland:2014:CCP,
author = "D. Weyland",
title = "On the computational complexity of the Probabilistic
Traveling Salesman Problem with Deadlines",
journal = j-THEOR-COMP-SCI,
volume = "540--541",
number = "??",
pages = "156--168",
day = "26",
month = jun,
year = "2014",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Jun 28 08:55:50 MDT 2014",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397513008724",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
}
Related entries
- computational,
344(2)279,
411(2)377,
411(2)542,
411(6)888,
411(40)3774,
412(1)183,
412(20)2048,
412(23)2457,
412(23)2468,
412(35)4721,
412(41)5760,
412(41)5771,
412(43)6112,
412(48)6736,
436(1)106,
477(z)48,
504(z)83,
512(z)98,
559(z)3
- deadline,
411(40)3587,
554(z)229
- probabilistic,
411(22)2202,
411(22)2239,
411(50)4291,
412(12)1154,
412(15)1434,
412(21)2188,
412(25)2766,
412(28)3072,
412(38)5095,
413(1)36,
413(1)58,
419(1)2,
429(1)134,
471(z)27,
473(z)46,
498(z)10,
501(z)49,
503(z)61,
520(z)111,
522(z)44,
538(z)16,
538(z)37,
538(z)84,
538(z)103,
549(z)61,
559(z)42
- Salesman,
531(z)54
- traveling,
411(6)837,
412(4)345,
531(z)54