A Lexicographic 0.5-Approximation Algorithm for the Multiple Knapsack Problem

Original language	English
Pages (from-to)	264-277
Number of pages	14
Journal	Journal of Applied and Industrial Mathematics
Volume	12
Issue number	2
DOIs	https://doi.org/10.1134/S1990478918020072
Publication status	Published - 1 Apr 2018

approximation algorithm, approximation ratio, lexicographic ordering, multiple knapsack problem

ID: 13686315