Scheduling Conflict-Free Parties for a Dating Service

DOI10.2307/2974976MaRDI QIDQ4340672zbMATH OpenOpenAlexFDO

Authors Bryan L. Shader, C. L. Shader

Publication date 10 June 1997

Published in The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2974976

zbMATH Keywords

dating service

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to linear algebra (15-01) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• Optimal scheduling combinatorics
• Designing progressive dinner parties
• Stable matchings and linear inequalities
• Matroids you have known
• Seven problems: so different yet close

This page was built for publication: Scheduling Conflict-Free Parties for a Dating Service

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4340672)