arXiv (All)
open access
Servicing Matched Client Pairs with Facilities
We study Facility Location with Matching, a Facility Location problem where, given additional information about which pair of clients is compatible to be matched, we need to match as many clients as possible and assign each matched client pair to a same open facility at minimum total cost. The probl
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- From Helpful to Trustworthy: LLM Agents for Pair Programming#10449
- Register allocation by optimal graph coloring#395714
- Efficient allocation with ordinal preference intensities#144160
- Hospitals/Residents with Inseparable Couples: Finding a Coalition-Stable Assignment Is NP-Hard#925209
- Hospitals/Residents with Inseparable Couples: Finding a Coalition-Stable Assignment Is NP-Hard#920974
Record · ID 1104967
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive