scientific article; zbMATH DE number 1305096
From MaRDI portal
Publication:4252038
zbMath0929.90074MaRDI QIDQ4252038
Publication date: 18 January 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Matching models (91B68)
Related Items (24)
Modelling practical placement of trainee teachers to schools ⋮ Matching couples with Scarf's algorithm ⋮ Stable matchings of teachers to schools ⋮ Decision-making with reference information ⋮ Centralized allocation in multiple markets ⋮ Optimal cost-based allocations under two-sided preferences ⋮ ``Almost-stable matchings in the hospitals/residents problem with couples ⋮ Games of capacity manipulation in hospital-intern markets ⋮ Approximability results for stable marriage problems with ties. ⋮ A \((2-c\frac{1}{\sqrt{N}})\)-approximation algorithm for the stable marriage problem ⋮ The stable marriage problem: an interdisciplinary review from the physicist's perspective ⋮ Size versus stability in the marriage problem ⋮ Deferred acceptance algorithms: history, theory, practice, and open questions ⋮ A genetic algorithm for the project assignment problem ⋮ Keeping partners together: Algorithmic results for the hospitals/residents problem with couples ⋮ Size Versus Stability in the Marriage Problem ⋮ Improving solution times for stable matching problems through preprocessing ⋮ An efficient implementation of the Gale and Shapley “propose-and-reject” algorithm ⋮ The stable marriage problem with master preference lists ⋮ Stable matching problems with exchange restrictions ⋮ Stable marriage with ties and bounded length preference lists ⋮ Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems ⋮ The exchange-stable marriage problem ⋮ Hard variants of stable marriage.
This page was built for publication:
