Linear Assignment Problems and Extensions

Rainer E. Burkard () and Eranda Çela ()
Additional contact information
Rainer E. Burkard: Technical University Graz, Institute of Mathematics
Eranda Çela: Technical University Graz, Institute of Mathematics

A chapter in Handbook of Combinatorial Optimization, 1999, pp 75-149 from Springer

Abstract: Abstract Assignment problems deal with the question how to assign n items (e.g. jobs) to n machines (or workers) in the best possible way. They consist of two components: the assignment as underlying combinatorial structure and an objective function modeling the ”best way”.

Keywords: Bipartite Graph; Assignment Problem; Dual Solution; Cost Coefficient; Discrete Apply Mathematic (search for similar items in EconPapers)
Date: 1999
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4757-3023-4_2

Ordering information: This item can be ordered from
http://www.springer.com/9781475730234

DOI: 10.1007/978-1-4757-3023-4_2

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().