A business dinner problem - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year :

A business dinner problem

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. 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.
Fichier principal
Vignette du fichier
Dinners.pdf (164.58 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00738003 , version 1 (03-10-2012)
hal-00738003 , version 2 (08-10-2012)
hal-00738003 , version 3 (06-03-2014)

Identifiers

  • HAL Id : hal-00738003 , version 3

Cite

Alejandra Estanislao, Frédéric Meunier. A business dinner problem. 2012. ⟨hal-00738003v3⟩
110 View
109 Download

Share

Gmail Facebook Twitter LinkedIn More