Linear programming brings marital bliss

From MaRDI portal
Publication:1122480

DOI10.1016/0167-6377(89)90041-2zbMath0675.90058OpenAlexW2121619875MaRDI QIDQ1122480

John H. Vande Vate

Publication date: 1989

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(89)90041-2




Related Items (57)

Stable matchings and linear inequalitiesSatisfied two-sided matching: a method considering elation and disappointment of agentsCharacterization of super-stable matchingsEquivalence of two-sided stable matchingStability Representations of Many-to-One Matching Problems: An Integer Optimization ApproachBlockers and antiblockers of stable matchingsA branch-and-price algorithm for stable workforce assignments with hierarchical skillsThe object allocation problem with random prioritiesAn extendable stable matching algorithm of a kind of bipartite graphOn the stable marriage polytopeQuasi-Popular Matchings, Optimality, and Extended FormulationsCanonical monotone decompositions of fractional stable matchingsStable matchings and linear programmingOptimizing a generalized Gini index in stable marriage problems: NP-hardness, approximation and a polynomial time special caseReview of the theory of stable matchings and contract systemsCounting vertices of integral polytopes defined by facetsStable matching: An integer programming approachStable marriages and search frictionsOnline 2-stage stable matchingOn the set of stable matchings in a bipartite graphImproved approximation algorithms for two variants of the stable marriage problem with tiesStable allocations and partially ordered setsMarriage market with indifferences: a linear programming approachOn the stable \(b\)-matching polytope.An elementary integrality proof of Rothblum's stable matching formulationTask assignment with controlled and autonomous agentsBistable versions of the marriages and roommates problemsThe stable tournament problem: matching sports schedules with preferencesExistence of stable outcomes and the lattice property for a unified matching marketMathematical models for stable matching problems with ties and incomplete listsStable fractional matchingsCharacterization of stable matchings as extreme points of a polytopeThe rank pricing problem with tiesStable marriage with general preferencesA note on the lattice structure for matching markets via linear programmingComplexity of the sex-equal stable marriage problemCompromises and rewards: stable and non-manipulable probabilistic matchingEquitable representation and recruitmentUnnamed ItemImproving solution times for stable matching problems through preprocessingEfficiency and stability of probabilistic assignments in marriage problemsAffinely representable lattices, stable matchings, and choice functionsA Matroid Approach to Stable Matchings with Lower QuotasMaximum stable matching with one-sided ties of bounded lengthCourtship and linear programmingAffinely representable lattices, stable matchings, and choice functionsStable multi-skill workforce assignmentsThe diameter of the stable marriage polytope: bounding from belowA characterization of strongly stable fractional matchingsRandom matching under priorities: stability and no envy conceptsOn a cutting plane heuristic for the stable roommates problem and its applicationsPolyhedral Aspects of Stable MarriagePopularity, Mixed Matchings, and Self-DualityUnnamed ItemBipartite choicesA polynomial-time algorithm for the bistable roommates problemUnderstanding Popular Matchings via Stable Matchings



Cites Work


This page was built for publication: Linear programming brings marital bliss