Approximation algorithms for a two-phase knapsack problem

DOI10.1007/978-3-319-94776-1_6OpenAlexW2810989909MaRDI QIDQ1790954

Kameng Nip, Zhen-bo Wang

Publication date: 4 October 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-94776-1_6

zbMATH Keywords

approximation algorithmsknapsackpolynomial-time approximation schememultiple knapsack

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (1)

Maximum coverage with cluster constraints: an LP-based approximation technique

This page was built for publication: Approximation algorithms for a two-phase knapsack problem