A business dinner problem

MaRDI QIDQ2829345zbMATH OpenFDO

Authors Alejandra Estanislao, Frédéric Meunier

Publication date 27 October 2016

Published in JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1610.00585

zbMATH Keywords

optimizationlinear programmingHowell designsmeeting scheduling

Mathematics Subject Classification ID

Linear programming (90C05) Other designs, configurations (05B30) Production models (90B30) Combinatorial aspects of packing and covering (05B40)

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.

Recommendations

• The Caterer Problem
• The CEO problem [multiterminal source coding]

Cited in

(3)

• Dinner, Dancing, and Tennis, Anyone?
• Designing progressive dinner parties
• A greedy algorithm for the social golfer and the Oberwolfach problem

This page was built for publication: A business dinner problem

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