Approximation schemes for knapsack problems with shelf divisions

Xavier‚ EC; Miyazawa‚ FK

Advanced search

Search - Use quotation marks to get a more specific result

Index

Field of knowledge

Start date

Betweenand

(Reference retrieved automatically from Google Scholar through information on FAPESP grant and its corresponding number as mentioned in the publication by the authors.)

Approximation schemes for knapsack problems with shelf divisions

Full text
Author(s):	Xavier‚ EC ; Miyazawa‚ FK Total Authors: 2
Document type:	Journal article
Source:	THEORETICAL COMPUTER SCIENCE; v. 352, n. 1, p. 71-84, 2006.

FAPESP's process:	03/09925-5 - Foundations of computer science: combinatory algorithms and discrete structures
Grantee:	Yoshiharu Kohayakawa
Support Opportunities:	PRONEX Research - Thematic Grants

Short URL