Learning-augmented algorithms for online subset sum

As one of Karp’s 21 NP-complete problems, the subset sum problem, as well as its generalization, has been well studied. Among the rich literature, there is little work on the online version, where items arrive over list and irrevocable decisions on packing them or not must be made immediately. Under...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of global optimization Vol. 87; no. 2-4; pp. 989 - 1008
Main Authors:	Xu, Chenyang, Zhang, Guochuan
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.11.2023 Springer
Subjects:	Algorithms Analysis Computational linguistics Computer Science Language processing Mathematics Mathematics and Statistics Natural language interfaces Neural networks Operations Research/Decision Theory Optimization Real Functions Learning-augmented algorithms Untrusted predictions Competitive analysis 68W01 Subset sum
ISSN:	0925-5001, 1573-2916
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!