Last update: Sat Jan 6 02:03:49 MST 2018
@Article{Stojmenovic:1988:ASG,
author = "I. Stojmenovi{\'c} and M. Miyakawa",
title = "Applications of a Subset-Generating Algorithm to Base
Enumeration, Knapsack and Minimal Covering Problems",
journal = j-COMP-J,
volume = "31",
number = "1",
pages = "65--70",
month = feb,
year = "1988",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/31.1.65",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Dec 4 14:48:24 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/31/1.toc;
http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_01/",
URL = "http://comjnl.oxfordjournals.org/content/31/1/65.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_01/tiff/65.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_01/tiff/66.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_01/tiff/67.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_01/tiff/68.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_01/tiff/69.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_01/tiff/70.tif",
acknowledgement = ack-nhfb,
affiliation = "Univ of Novi Sad, Novi Sad, Yugosl",
affiliationaddress = "Univ of Novi Sad, Novi Sad, Yugosl",
classcodes = "C1160 (Combinatorial mathematics); C4240 (Programming
and algorithm theory)",
classification = "723",
corpsource = "Inst. of Math., Novi Sad Univ., Yugoslavia",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "Algorithms; backtrack procedure; base; base
enumeration; combinatorial mathematics; computer
programming; cut technique; enumeration; knapsack
problems; lexicographic enumeration; minimal covering
problems; programming theory; set theory;
subset-generating algorithm",
treatment = "T Theoretical or Mathematical",
}