The integral stable allocation problem on graphs
type: Item
instance of: scholarly article
title: The integral stable allocation problem on graphs
zbMATH Open document ID: 1264.05098
author: Péter Biró
author: Tamás Fleiner
published in: Discrete Optimization
publication date: 2013-05-31T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 90B20
Mathematics Subject Classification ID: 90C09
zbMATH DE Number: 6168921
zbMATH Keywords: stable matching problem
zbMATH Keywords: roommates problem
zbMATH Keywords: stable allocation problem
zbMATH Keywords: edge capacity
zbMATH Keywords: vertex capacity
zbMATH Keywords: inductive algorithm
zbMATH Keywords: strongly polynomial time
zbMATH Keywords: integral capacities
zbMATH Keywords: weakly polynomial algorithm
MaRDI profile type: Publication
full work available at URL: j.disopt.2010.02.002
OpenAlex ID: W2045868247
cites work: The Stable Allocation (or Ordinal Transportation) Problem
cites work: Stable schedule matching under revealed preference.
cites work: Algorithms and Computation
cites work: On the stable \(b\)-matching polytope.
cites work: On a generalization of the stable roommates problem
cites work: The stable fixtures problem -- a many-to-many extension of stable roommates
cites work: The stable crews problem
cites work: College Admissions and the Stability of Marriage
cites work: Q4369422
cites work: Q3995616
cites work: A necessary and sufficient condition for the existence of a complete stable matching
cites work: On a lemma of Scarf.
cites work: Random Paths to Stability in Two-Sided Matching
cites work: A generalization of the stable matching problem
cites work: An upper bound for the solvability probability of a random stable roommates instance
cites work: The dynamics of stable matchings and half-matchings for the stable marriage and roommates problems
DOI: 10.1016/J.DISOPT.2010.02.002
description: scientific article; zbMATH DE number 6168921