The Fair OWA One-to-one Assignment Problem: NP-hardness and Polynomial Time Special Cases. - Archive ouverte HAL Access content directly
Journal Articles Algorithmica Year : 2018

The Fair OWA One-to-one Assignment Problem: NP-hardness and Polynomial Time Special Cases.

Michel Minoux
  • Function : Author
  • PersonId : 846863
Patrice Perny

Dates and versions

hal-01764024 , version 1 (11-04-2018)

Identifiers

Cite

Julien Lesca, Michel Minoux, Patrice Perny. The Fair OWA One-to-one Assignment Problem: NP-hardness and Polynomial Time Special Cases.. Algorithmica, In press, ⟨10.1007/s00453-018-0434-5⟩. ⟨hal-01764024⟩
183 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More