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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of global optimization Ročník 87; číslo 2-4; s. 989 - 1008
Hlavní autori:	Xu, Chenyang, Zhang, Guochuan
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.11.2023 Springer
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!