Tractability, hardness, and kernelization lower bound for and/or graph solution.

Uéverton dos Santos Souza Fábio Protti

Published in: Discret. Appl. Math. (2017)

Keyphrases

lower bound
optimal solution
computational complexity
worst case
upper bound
exact solution
objective function
np hard
mathematical model
branch and bound
branch and bound method
lagrangian relaxation
branch and bound algorithm
np complete
least squares
neural network
linear equations
data sets