Last update: Sat Jan 6 02:03:49 MST 2018
@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",
}