Matchings

Gerard Sierksma () and Diptesh Ghosh ()
Additional contact information
Gerard Sierksma: Fac. Economische Wetenschappen Rijksuniversiteit Groningen

Chapter 4 in Networks in Action, 2010, pp 87-115 from Springer

Abstract: Abstract GTC has five managers Anna, Boris, Caren, Derek, and Elija, labeled A, B, C, D, and E, respectively. It also has five projects labeled P1 through P5. Figure 4.1 shows the ability of each of the executives to handle projects – a link between a manager and a project indicates that the manager has the skill set required to handle the project. A manager can handle at most one project, and each project, if assigned to a manager, needs to be assigned to exactly one manager. GTC wants to find out how to assign projects to managers such that the maximum number of projects will be assigned. This problem, and others similar to it in nature in which solutions correspond to pairing of entities are referred to as matching problems. The solutions to these problems are called matchings. Formally stated, matchings are subsets of edges in a network such that no two edges in the set are incident on the same node of the network. Thus, a solution to GTC’s problem would be the set of edges {A – P3, B – P2, C – P5}.

Keywords: Match Problem; Maximal Match; Foreign Student; Optimal Assignment; Linear Programming Formulation (search for similar items in EconPapers)
Date: 2010
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:isochp:978-1-4419-5513-5_7

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

DOI: 10.1007/978-1-4419-5513-5_7

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().