Improved approximation algorithms for k-submodular maximization under a knapsack constraint
Dung T. K. Ha, Canh V. Pham, Tan D. Tran
Year of publication: |
2024
|
---|---|
Authors: | Ha, Dung T. K. ; Pham, Canh V. ; Tran, Tan D. |
Published in: |
Computers & operations research : an international journal. - Amsterdam [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 1499736-8. - Vol. 161.2024, Art.-No. 106452, p. 1-14
|
Subject: | Combinatorial optimization | -submodular | Approximation algorithm | Knapsack constraint | Algorithmus | Algorithm | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Integer programming | Operations Research | Operations research |
Saved in:
Online Resource
Saved in favorites
Similar items by subject
-
Sun, Peter, (2014)
-
Models for the two-dimensional level strip packing problem : a review and a computational evaluation
Bezerra, Vanessa M. R., (2020)
-
Models and algorithms for the bin-packing problem with minimum color fragmentation
Mehrani, Saharnaz, (2022)
- More ...