scientific article; zbMATH DE number 5691235
From MaRDI portal
Publication:5306146
Recommendations
- A generalization of the stable matching problem
- scientific article; zbMATH DE number 4078356
- Optimal general matchings
- A New Approach to Stable Matching Problems
- Implementation in generalized matching problems
- On optimal matchings
- A unifying approach to the structures of the stable matching problems
- An extension of matching theory
- On the completeness of a generalized matching problem
- Monotonic and implementable solutions in generalized matching problems.
Cited in
(15)- Optimal general matchings
- Designing matching mechanisms under constraints: an approach from discrete convex analysis
- Building and combining matching algorithms
- A fast algorithm for the path 2-packing problem
- A weighted independent even factor algorithm
- Packing A-paths in group-labelled graphs via linear matroid parity
- A Weighted K t,t -Free t-Factor Algorithm for Bipartite Graphs
- Optimal Matching and Empirical Measures
- More Efficient Match-Making and Satisfiability The Five Card Trick
- Matchings and flows in hypergraphs
- Generalized coarse matching
- Ordinal and cardinal solution concepts for two-sided matching
- Algorithms for some graph theoretical optimization problems (abstract of thesis)
- The manipulability of matching rules via segmentation
- The parity problem of polymatroids without double circuits
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5306146)
