Last update: Tue Mar 5 02:04:20 MST 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{Dyer:1984:BBA,
author = "M. E. Dyer and N. Kayal and J. Walker",
title = "A branch and bound algorithm for solving the
multiple-choice knapsack problem",
journal = j-J-COMPUT-APPL-MATH,
volume = "11",
number = "2",
pages = "231--249",
month = oct,
year = "1984",
CODEN = "JCAMDI",
ISSN = "0377-0427 (print), 1879-1778 (electronic)",
ISSN-L = "0377-0427",
bibdate = "Sat Feb 25 11:59:54 MST 2017",
bibsource = "http://www.math.utah.edu/pub/tex/bib/jcomputapplmath1980.bib",
URL = "http://www.sciencedirect.com/science/article/pii/0377042784900232",
acknowledgement = ack-nhfb,
fjournal = "Journal of Computational and Applied Mathematics",
journal-URL = "http://www.sciencedirect.com/science/journal/03770427",
}
Related entries
- algorithm,
6(2)133,
6(2)145,
6(3)171,
6(3)201,
6(3)247,
6(4)259,
6(4)295,
7(1)77,
7(2)151,
7(4)237,
7(4)271,
8(3)159,
8(3)179,
8(3)203,
8(4)275,
8(4)293,
9(1)91,
10(2)147,
11(1)119,
11(2)161,
11(2)209,
12(z)433,
12(z)517,
12(z)551,
12(z)579,
12(z)635,
15(2)137,
15(2)161,
15(2)191,
16(1)1,
16(2)145,
16(2)215,
17(3)237,
19(1)9,
19(1)89,
19(1)117,
19(1)141,
19(3)313,
21(1)55,
21(3)333,
22(1)89,
23(1)11,
23(3)367,
24(1)13,
25(1)33,
25(1)111,
25(3)341,
25(3)351,
25(3)379,
27(1)17,
27(1)37,
27(1)53,
27(1)95,
27(1)191,
27(3)421,
28(z)231,
28(z)237
- bound,
8(2)121,
10(1)65,
10(2)229,
10(2)245,
11(1)57,
12(z)179,
16(2)241,
17(3)355,
20(z)289,
21(2)245,
23(3)267,
25(3)351,
28(z)145
- solving,
6(3)171,
6(3)213,
8(1)35,
8(2)93,
9(2)167,
9(3)229,
10(1)71,
10(2)157,
11(1)39,
11(2)175,
12(z)331,
14(1)19,
14(1)125,
14(3)371,
15(2)137,
15(3)311,
15(3)339,
16(2)169,
16(3)343,
18(2)235,
18(2)249,
18(3)353,
19(3)343,
21(1)111,
21(2)161,
24(1)33,
24(1)107,
24(1)227,
24(1)241,
24(1)265,
24(3)355,
25(1)79,
25(2)237,
25(3)351,
27(1)323,
28(z)391