Algorithms and Computation

DOI10.1007/B94771zbMath1205.05237OpenAlexW1769833081MaRDI QIDQ5191678

Akihisa Tamura, Akinobu Eguchi, Satoru Fujishige

Publication date: 7 August 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b94771

Mathematics Subject Classification ID

Integer programming (90C10) Transversal (matching) theory (05D15)

Related Items (8)

Finding a Stable Allocation in Polymatroid Intersection ⋮ Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested ⋮ The integral stable allocation problem on graphs ⋮ A Generalized Polymatroid Approach to Stable Matchings with Lower Quotas ⋮ Two algorithms for the student-project allocation problem ⋮ Stability and competitive equilibria in multi-unit trading networks with discrete concave utility functions ⋮ Applications of discrete convex analysis to mathematical economics ⋮ On the Lattice Structure of Stable Allocations in a Two-Sided Discrete-Concave Market

This page was built for publication: Algorithms and Computation