The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases

Abraham P. Punnen Piyashat Sripratak Daniel Karapetyan

Published in: CoRR (2012)

Keyphrases

polynomially solvable
np complete
processing times
special case
np hard
case base
minimum cost
real time
makespan minimization
neural network
knowledge base
real valued
bipartite graph