The bilinear assignment problem: complexity and polynomially solvable special cases.
Ante CusticVladyslav SokolAbraham P. PunnenBinay BhattacharyaPublished in: Math. Program. (2017)
Keyphrases
- polynomially solvable
- special case
- np hard
- np complete
- makespan minimization
- computational complexity
- worst case
- processing times
- minimum cost
- decision problems
- scheduling problem
- lower bound
- approximation algorithms
- metaheuristic
- complexity analysis
- integer programming
- computational cost
- information systems
- flowshop
- feasible solution
- combinatorial optimization
- genetic algorithm
- cost function