Open AccessThe Generalized Multiple-Choice Multi-Divisional Linear Programming Knapsack Problem
Author(s) -
Joong-Yeon Won
Publication year - 2014
Publication title -
daehan san'eob gonghag hoeji/daehan saneop gonghak hoeji
Language(s) - English
Resource type - Journals
eISSN - 2234-6457
pISSN - 1225-0988
DOI - 10.7232/jkiie.2014.40.4.396
Subject(s) - knapsack problem , continuous knapsack problem , change making problem , cutting stock problem , mathematics , mathematical optimization , linear programming relaxation , generalized assignment problem , polynomial time approximation scheme , relaxation (psychology) , linear programming , extension (predicate logic) , transformation (genetics) , subset sum problem , optimization problem , computer science , psychology , social psychology , biochemistry , chemistry , gene , programming language