Login / Signup
An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem.
Fabio Furini
Ivana Ljubic
Markus Sinnl
Published in:
Eur. J. Oper. Res. (2017)
Keyphrases
</>
packing problem
minimum cost
np hard
integer programming
approximation algorithms
bin packing
network flow
network flow problem
spanning tree
capacity constraints
network simplex algorithm
similarity measure
high dimensional
arbitrary shaped