A business dinner problem
Alejandra Estanislao, Fr\'ed\'eric Meunier

TL;DR
This paper addresses an optimization problem involving scheduling dinners so that each customer meets each supplier exactly once, with constraints on table sizes and meeting repetitions, providing bounds and optimal solutions.
Contribution
It introduces bounds and closed-form optimal solutions for a complex scheduling problem involving suppliers, customers, and table constraints.
Findings
Provided lower and upper bounds for the scheduling problem.
Derived closed-form expressions for optimal solutions in specific cases.
Established the minimum number of evenings needed for the given constraints.
Abstract
We are given suppliers and customers, and a set of tables. Every evening of the forthcoming days, there will be a dinner. Each customer must eat with each supplier exactly once, but two suppliers may meet at most once at a table. The number of customers and the number of suppliers who can sit together at a table are bounded above by fixed parameters. What is the minimum number of evenings to be scheduled in order to reach this objective? This question was submitted by a firm to the Junior company of a French engineering school some years ago. Lower and upper bounds are given in this paper, as well as proven optimal solutions with closed-form expressions for some cases.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsScheduling and Timetabling Solutions · Analytic Number Theory Research · Limits and Structures in Graph Theory
