Entry Boardman:1986:RAO from compj1980.bib
Last update: Sat Jan 6 02:03:49 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{Boardman:1986:RAO,
author = "J. T. Boardman and C. Garrett and G. C. A. Robson",
title = "A Recursive Algorithm for the Optimal Solution of a
Complex Allocation Problem Using a Dynamic Programming
Formulation",
journal = j-COMP-J,
volume = "29",
number = "2",
pages = "182--186",
month = apr,
year = "1986",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/29.2.182",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
MRclass = "90C27 (90B05 90C10)",
MRnumber = "841 679",
bibdate = "Tue Dec 4 14:48:20 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/29/2.toc;
http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_29/Issue_02/",
URL = "http://comjnl.oxfordjournals.org/content/29/2/182.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_29/Issue_02/tiff/182.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_29/Issue_02/tiff/183.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_29/Issue_02/tiff/184.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_29/Issue_02/tiff/185.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_29/Issue_02/tiff/186.tif",
acknowledgement = ack-nhfb,
affiliation = "Brighton Polytechnic, Brighton, Engl",
affiliationaddress = "Brighton Polytechnic, Brighton, Engl",
classcodes = "C1180 (Optimisation techniques); C4240 (Programming
and algorithm theory)",
classification = "716; 718; 722; 723; 921",
corpsource = "Dept. of Electr. and Electron. Eng., Brighton
Polytech., UK",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "algorithm theory; algorithmic solution; Algorithms;
architecture; complex allocation; complex allocation
problem; complexity; computer programming; computer
systems, digital --- Multiprocessing; dynamic
programming; dynamic programming formulation; Hanoi
problem; mathematical programming, dynamic;
multiplicity; optimal solution; optimization;
primitive; problem; recursive algorithm;
telecommunication systems; Towers of; Towers of Hanoi
problem",
treatment = "T Theoretical or Mathematical",
}
Related entries
- 90B05,
23(3)207
- 90C10,
23(3)256,
32(3)273
- algorithmic,
23(1)46,
25(2)264,
28(1)82,
30(1)43,
31(4)325
- allocation,
23(2)147,
23(2)153,
23(4)298,
24(1)29,
25(1)32,
25(1)52,
25(1)159,
25(2)199,
25(3)388,
26(1)25,
26(2)113,
27(1)18,
27(2)135,
27(4)328,
29(1)47,
29(2)127,
29(3)253,
29(6)522,
30(1)80,
30(2)119,
30(3)201,
30(4)308,
30(4)362,
30(6)535,
31(4)344,
31(6)565
- architecture,
23(2)115,
23(4)382,
24(1)25,
24(1)62,
24(2)139,
24(3)210,
24(4)353,
25(1)74,
25(1)153,
25(2)207,
26(1)43,
26(3)208,
27(2)127,
27(3)254,
27(4)294,
27(4)362,
28(2)105,
28(2)138,
28(2)170,
28(3)282,
29(2)103,
29(4)300,
29(5)416,
29(5)451,
29(6)486,
30(2)110,
30(2)157,
30(2)189,
30(3)214,
30(4)289,
30(5)404,
30(5)413,
32(1)29,
32(2)175,
32(3)267,
32(3)281,
32(4)370,
32(5)453,
32(5)461,
32(6)505
- Boardman, J. T.,
29(2)161
- complex,
23(2)98,
23(4)353,
24(3)263,
25(1)121,
28(4)366,
29(2)161,
29(4)289
- complexity,
25(1)63,
25(3)379,
26(3)224,
26(4)293,
26(4)354,
27(1)72,
27(2)135,
27(4)315,
27(4)340,
28(1)5,
28(1)78,
28(5)487,
28(5)496,
29(2)103,
29(2)161,
29(2)176,
29(4)300,
29(4)322,
29(4)330,
29(5)451,
30(1)43,
30(2)176,
30(3)201,
30(3)223,
30(3)233,
30(3)258,
30(3)282,
30(4)308,
30(4)376,
30(5)433,
31(1)56,
31(1)71,
31(1)83,
31(3)283,
31(4)289,
31(6)490,
31(6)545,
31(6)553,
31(6)561,
31(6)567,
32(4)362,
32(5)474
- dynamic,
23(1)53,
23(2)115,
23(2)147,
23(4)298,
24(4)383-1,
25(1)63,
25(2)199,
25(3)358,
25(3)388,
25(4)478,
26(1)25,
27(1)87,
27(2)135,
27(2)143,
27(3)284,
27(3)284-1,
27(4)328,
28(2)170,
28(3)250,
28(3)330,
29(1)52,
29(2)127,
29(2)189,
29(2)189-1,
30(2)119,
30(3)258,
30(6)541,
31(4)296,
31(5)457,
31(6)531,
32(1)16,
32(3)194,
32(3)241
- formulation,
24(3)271,
30(5)458
- Hanoi,
25(4)442,
27(1)80,
27(2)171,
27(3)278,
29(2)161,
29(2)187,
30(1)70,
30(4)376,
32(2)187
- mathematical,
24(2)177,
24(2)180,
24(2)184,
25(1)7,
25(1)56,
25(4)478,
26(1)6,
26(2)97,
26(2)106,
26(3)193,
27(2)165,
27(4)368-1,
28(1)5,
28(1)78,
28(1)89,
28(2)142,
28(2)179,
28(4)414,
28(4)417,
28(4)426,
28(5)498,
28(5)524,
28(5)530,
28(5)538,
29(1)36,
29(1)52,
29(2)171,
29(2)176,
29(4)378,
29(5)416,
29(6)553,
30(1)16,
30(1)20,
30(1)70,
30(2)128,
30(2)189,
30(3)258,
30(3)268,
30(3)282,
30(4)298,
30(5)458,
30(6)498,
30(6)569,
31(1)61,
31(1)71,
31(1)76,
31(2)155,
31(3)229,
31(3)243,
31(3)283,
31(4)364,
31(6)490,
31(6)545,
31(6)557,
31(6)564,
31(6)567,
32(1)45,
32(1)68,
32(1)76,
32(1)86,
32(1)93,
32(2)175,
32(4)351,
32(4)374,
32(4)377
- multiprocessing,
24(4)353,
25(1)22,
28(2)105,
28(2)142,
28(5)449,
28(5)466,
29(1)1,
29(2)109,
29(2)118,
29(5)390,
29(5)404,
30(3)214,
31(3)201,
32(1)29,
32(2)162,
32(3)267,
32(4)362
- optimal,
23(4)347,
25(1)32,
25(1)93,
25(2)183,
25(2)239,
25(3)338,
27(4)321,
28(1)5,
28(1)17,
28(5)524,
29(1)52,
29(2)161,
30(4)298,
30(5)433,
31(4)344,
32(3)194,
32(3)246
- optimization,
23(4)338,
25(2)188,
25(3)340,
26(2)154,
27(4)301,
28(5)518,
29(2)118,
29(6)495,
30(5)458,
31(1)71,
31(2)99,
31(4)344,
32(2)152
- primitive,
25(1)121,
25(4)448,
26(2)134,
28(3)203,
29(2)109,
32(3)267
- recursive,
23(4)332,
25(2)231,
26(1)15,
26(3)205,
27(2)171,
28(1)78,
29(2)161,
29(6)531,
30(4)376,
31(3)229,
31(3)283,
31(4)358,
31(6)561,
31(6)565,
32(1)36,
32(3)281
- Robson, G. C. A.,
29(2)161
- solution,
23(1)85,
23(4)338,
24(2)180,
24(2)184,
25(1)56,
25(2)231,
27(2)171,
28(4)366,
30(4)376,
31(1)76,
32(1)13,
32(1)45,
32(2)152,
32(2)162,
32(2)187
- telecommunication,
31(2)175
- tower,
25(4)442,
27(1)80,
27(2)171,
27(3)278,
29(2)161,
29(2)187,
30(1)70,
30(4)376,
32(2)187
- using,
23(1)41,
23(2)142,
23(4)380,
23(4)381,
24(2)118,
24(3)263,
24(3)271,
24(4)295,
24(4)324,
25(1)63,
25(1)84,
26(2)113,
26(4)344,
28(2)112,
28(4)409,
28(4)414,
29(2)118,
29(2)176,
29(3)201,
29(5)423,
29(6)564,
30(1)87,
30(2)176,
30(4)298,
30(4)343,
30(5)437,
30(6)541,
31(3)201,
31(3)269,
31(4)289,
31(6)525,
31(6)567,
31(6)570,
32(2)142,
32(3)273,
32(4)341,
32(5)470