Branching proofs of infeasibility in low density subset sum problems

Gábor Pataki Mustafa Kemal Tural

Published in: CoRR (2008)

Keyphrases

low density
real time
np complete
machine learning
expert systems
optimization problems
high density
problems involving
learning algorithm
information systems
objective function
lower bound
low cost
neural network
feasible solution
branch and bound algorithm
benchmark problems
database