Editing Assignment problem (section)

== References and further reading ==
{{Reflist}}

*{{cite book | last=Brualdi | first=Richard A. | title=Combinatorial matrix classes | series=Encyclopedia of Mathematics and Its Applications | volume=108 | location=Cambridge | publisher=[[Cambridge University Press]] | year=2006 | isbn=978-0-521-86565-4 | zbl=1106.05001 | url-access=registration | url=https://archive.org/details/combinatorialmat0000brua }}
* {{cite book | author-link = Rainer Burkard | first = Rainer | last = Burkard |author2=M. Dell'Amico|author3=S. Martello | year = 2012 | title = Assignment Problems (Revised reprint) | publisher = SIAM | isbn = 978-1-61197-222-1 }}
* {{cite book | author-link = Dimitri Bertsekas | first = Dimitri | last = Bertsekas | year = 1998 | title = Network Optimization: Continuous and Discrete Models | publisher = Athena Scientific | isbn = 978-1-886529-02-1 }}

{{Authority control}}

[[Category:Combinatorial optimization]]
[[Category:Matching (graph theory)]]
[[Category:Polynomial-time problems]]
[[Category:Linear programming]]