Login / Signup
The bipartite unconstrained 0-1 quadratic programming problem: Polynomially solvable cases.
Abraham P. Punnen
Piyashat Sripratak
Daniel Karapetyan
Published in:
Discret. Appl. Math. (2015)
Keyphrases
</>
polynomially solvable
np complete
special case
np hard
makespan minimization
neural network
processing times
feasible solution
bipartite graph
graph model
image segmentation
feature space
dynamic programming
worst case
computationally efficient
real valued