Entry Albano:1980:TSA 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{Albano:1980:TSA,
author = "A. Albano and R. Orsini",
title = "A tree search approach to the ${M}$-partition and
{Knapsack} problems",
journal = j-COMP-J,
volume = "23",
number = "3",
pages = "256--261",
month = aug,
year = "1980",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/23.3.256",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
MRclass = "90C10 (68C25 68E05)",
MRnumber = "81i:90140",
bibdate = "Tue Dec 4 14:48:08 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/23/3.toc;
http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_23/Issue_03/",
URL = "http://comjnl.oxfordjournals.org/content/23/3/256.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_23/Issue_03/tiff/256.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_23/Issue_03/tiff/257.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_23/Issue_03/tiff/258.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_23/Issue_03/tiff/259.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_23/Issue_03/tiff/260.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_23/Issue_03/tiff/261.tif",
acknowledgement = ack-nhfb,
classcodes = "C1160 (Combinatorial mathematics); C1180 (Optimisation
techniques)",
classification = "723",
corpsource = "Istituto di Scienze dell'Informazione, Pisa, Italy",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "computer programming; integer programming; knapsack
problems; M partition problem; tree search; trees
(mathematics)",
treatment = "T Theoretical or Mathematical",
}
Related entries
- 68C25,
23(2)161,
24(2)148
- 68E05,
23(1)61,
23(4)344,
26(2)106
- 90C10,
29(2)182,
32(3)273
- Albano, A.,
23(4)338
- approach,
23(1)3,
23(1)9,
23(1)28,
23(2)114-1,
23(3)223,
23(4)317,
24(3)222,
24(4)320,
25(1)12,
25(3)353,
25(4)410,
25(4)442,
25(4)492,
26(3)255,
26(3)283,
26(4)293,
26(4)360,
26(4)383,
27(1)3,
27(1)37,
27(2)171,
27(3)246,
28(1)59,
28(1)89,
28(2)97,
28(2)162,
28(4)353,
29(2)161,
29(2)189,
29(2)189-1,
29(3)222,
29(4)330,
29(5)385,
30(1)8,
30(2)119,
30(2)176,
30(3)258,
30(5)393,
30(5)437,
30(6)507,
31(2)133,
31(2)182,
31(3)243,
31(5)409,
32(2)152,
32(2)162,
32(5)386,
32(5)437
- integer,
23(4)332,
25(4)471,
26(2)187,
26(2)187,
27(1)84,
29(2)171,
30(4)372,
32(3)273
- knapsack,
31(1)65
- M,
23(1)89,
23(2)160,
24(1)91,
25(2)287
- mathematics,
23(2)161,
23(3)248,
23(4)332,
25(1)158,
25(2)235,
25(2)239,
25(2)257,
26(2)97,
26(2)106,
26(2)188,
26(3)193,
26(3)205,
26(3)224,
27(2)178,
27(2)184,
27(3)218,
27(3)225,
27(4)368-1,
28(1)73,
28(2)105,
28(3)313,
28(4)417,
28(4)426,
28(4)433,
28(4)439,
28(5)538,
29(1)36,
29(1)52,
29(1)76,
29(2)171,
29(2)176,
29(6)564,
30(3)268,
30(3)277,
30(3)282,
30(4)355,
30(5)433,
30(6)569,
31(1)61,
31(1)65,
31(3)269,
31(4)330,
31(4)353,
31(4)364,
31(6)557,
31(6)564,
31(6)567,
32(1)68,
32(1)76,
32(3)281,
32(4)374,
32(5)470,
32(5)474,
32(6)571
- Orsini, R.,
23(4)338
- partition,
23(2)187,
23(4)332,
31(3)283,
32(3)281
- search,
23(3)248,
24(1)29,
25(1)2,
25(1)126,
25(1)158,
25(2)199,
25(3)353,
26(2)106,
26(2)154,
27(4)373,
28(2)105,
28(2)179,
28(3)264,
28(3)313,
28(3)319,
29(1)17,
29(1)36,
29(1)52,
29(1)76,
29(2)167,
29(2)176,
29(4)368,
29(5)436,
30(6)565,
31(2)175,
32(1)68,
32(3)212,
32(6)567,
z(z)z