Start
Journals
FIZ Karlsruhe
published by FIZ Karlsruhe GmbH
Start
Contact
Print
General Help
Advanced Search
Anywhere:
Author:
Title:
Source:
Year:
History
1
an:00005301
1
Query form:
Please fill in your query. A complete syntax description you will find on the
General Help
page.
io-port 00005301
BirĂ³, M.
The interval subset sum problem.
(English)
Optimization 21, No.2, 255-264 (1990).
We consider $m:=\lfloor\log\sb 2k\rfloor+1$ given integers, say $0
Reviewer:
U.Zimmermann (Braunschweig)
Keywords:
knapsack
;
interval subset sum problem
;
polynomial complexity
;
subset sum search
;
K-th largest subset
PDF
XML
AMS-TeX
TEXT
BIBTeX
DOI
© 2013 FIZ Karlsruhe GmbH
Contact
|
Copyright
|
Terms & Conditions
|
Site Map
|
Webmaster