The bilinear assignment problem: complexity and polynomially solvable special cases.
Autor: | Ćustić, Ante1 acustic@sfu.ca, Sokol, Vladyslav2 vsokol@sfu.ca, Punnen, Abraham1 apunnen@sfu.ca, Bhattacharya, Binay2 binay@sfu.ca |
---|---|
Zdroj: | Mathematical Programming. Nov2017, Vol. 166 Issue 1/2, p185-205. 21p. |
Databáze: | Academic Search Ultimate |
Externí odkaz: |