A note on the set union knapsack problem
Author:
- Ashwin ArulselvanAAAshwin Arulselvan
- 1 May 2014
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 169, 214-218
Abstract
No abstract availableKeywords
Funding Information
- DFG Research Center Matheon “Mathematics for Key Technologies” in Berlin
This publication has 3 references indexed in Scilit:
- Graph expansion and the unique games conjecture2010
- The budgeted maximum coverage problemInformation Processing Letters, 1999
- Note: On the set-union knapsack problemNaval Research Logistics (NRL), 1994