Login / Signup
Approximation schemes for non-separable non-linear boolean programming problems under nested knapsack constraints.
Nir Halman
Hans Kellerer
Vitaly A. Strusevich
Published in:
Eur. J. Oper. Res. (2018)
Keyphrases
</>
approximation schemes
dynamic programming
approximation algorithms
partial solutions
image segmentation
optimal solution
search algorithm
special case
np complete
constraint satisfaction
knapsack problem
boolean functions
packing problem
soft constraints
constrained problems