"The bilinear assignment problem: complexity and polynomially solvable ..."

Ante Custic et al. (2017)

> Home

Details and statistics

DOI: 10.1007/S10107-017-1111-1

access: closed

type: Journal Article

metadata version: 2017-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mp/CusticSPB17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mp/CusticSPB17
Ante Custic, Vladyslav Sokol, Abraham P. Punnen, Binay Bhattacharya:
The bilinear assignment problem: complexity and polynomially solvable special cases. Math. Program. 166(1-2): 185-205 (2017)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.