Pages that link to "Item:Q5189989"
From MaRDI portal
The following pages link to MAXIMUM WEIGHT CYCLE PACKING IN DIRECTED GRAPHS, WITH APPLICATION TO KIDNEY EXCHANGE PROGRAMS (Q5189989):
Displaying 16 items.
- House-swapping with divorcing and engaged pairs (Q277606) (← links)
- Maximising expectation of the number of transplants in kidney exchange programmes (Q342402) (← links)
- On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches (Q512864) (← links)
- A polyhedral study of the cardinality constrained multi-cycle and multi-chain problem on directed graphs (Q1654342) (← links)
- The kidney exchange problem: how hard is it to find a donor? (Q1931639) (← links)
- Adapting a kidney exchange algorithm to align with human values (Q1989404) (← links)
- The core of housing markets from an agent's perspective: Is it worth sprucing up your home? (Q2152118) (← links)
- Branch-and-cut-and-price for the cardinality-constrained multi-cycle problem in kidney exchange (Q2289919) (← links)
- An improved 2-agent kidney exchange mechanism (Q2346377) (← links)
- Mix and match: a strategyproof mechanism for multi-hospital kidney exchange (Q2347782) (← links)
- New insights on integer-programming models for the kidney exchange problem (Q2356206) (← links)
- Randomized parameterized algorithms for the kidney exchange problem (Q2632525) (← links)
- Computing the Deficiency of Housing Markets with Duplicate Houses (Q3058693) (← links)
- Hardness results for stable exchange problems (Q5965780) (← links)
- Approximation algorithms for the maximum-weight cycle/path packing problems (Q6542868) (← links)
- Performance evaluation of national and international kidney exchange programmes with the ENCKEP simulator (Q6661218) (← links)
