Old Web
English
Sign In
Acemap
>
Paper
>
Concise Representations and Complexity of Combinatorial Assignment Problems.
Concise Representations and Complexity of Combinatorial Assignment Problems.
2022
Fredrik Präntare
George Osipov
Leif Eriksson
Correction
Cite
Save
Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI
[]