References
- BartholdiJMcCroanKScheduling interviews for a job fairOperations Research199038695196010.1287/opre.38.6.951
- BoudharMFinkeGScheduling on a batch machine with job compatibilitiesBelgian Journal of Operations Research, Statistics and Computer Science2000401–26980
- BruckerPJurischBJurischMOpen shop problems with unit time operationsZeitschrift für Operations Research19933715973
- ChudnovskyMRobertsonNSeymourPThomasRThe strong perfect graph theoremAnnals of Mathematics200616415122910.4007/annals.2006.164.51
- ColbournCThe complexity of completing partial Latin squaresDiscrete Applied Mathematics198481253010.1016/0166-218X(84)90075-1
- ColbournCNonayGA golf design of order 11Journal of Statistical Planning and Inference1997581293110.1016/S0378-3758(96)00057-2
- EastonKNemhauserGTrickMThe traveling tournament problem description and benchmarksPrinciples and Practice of Constraint Programming CP 20012001580584
- ErnstATMillsRGJWelgamaPScheduling appointments at trade events for the Australian tourist commissionInterfaces2003333122310.1287/inte.33.3.12.16012
- EvenSItaiAShamirAOn the complexity of timetable and multicommodity flow problemsSIAM Journal on Computing19765469170310.1137/0205048
- GandibleuxXPajotBPonceletDModèle en variables 0–1 et système d’aide pour l’optimisation de l’organisation de bourses d’échanges de technologiesROADEF062006
- GareyMRJohnsonDSComputers and Intractability: A Guide to the Theory of NP-Completeness1979
- GrahamRLLawlerELLenstraJKRinnooy KanAHGOptimization and approximation in deterministic sequencing and scheduling: A surveyAnnals of Discrete Mathematics1979528732610.1016/S0167-5060(08)70356-X
- GrötschelMLovászLSchrijverAThe ellipsoid method and its consequences in combinatorial optimizationCombinatorica19811216919710.1007/BF02579273
- GuéretCBellenguez-MorineauOPavageauCPétonOPonceletDOptimisation de la planification de bourses d’échanges de technologiesROADEF 092009177178
- HuangYZhangXAlexanderPSA heuristic algorithm for optimizing business matchmaking schedulingInternational Journal of Operations Research and Information Systems201234597310.4018/joris.2012100104
- Katz B, Rutter I, Strasser B and Wagner D (2011). Speed dating: An algorithmic case study involving matching and scheduling. In: Pardalos P and Rebennack S (eds). Experimental Algorithms. Vol. 6630 of Lecture Notes in Computer Science, pp 292–303.
- KellererHTautenhahnTWoegingerGNote: Open-shop scheduling with release dates to minimize maximum latenessNaval Research Logistics199542114114510.1002/1520-6750(199502)42:1<141::AID-NAV3220420111>3.0.CO;2-3
- LapègueTBellenguez-MorineauOGuéretCScheduling of a speed-dating eventOR 2011201199100
- Rinaldi F and Serafini P (2007). Scheduling school meetings. In: Burke E and Rudová H (eds). Practice and Theory of Automated Timetabling VI. Vol. 3867 of Lecture Notes in Computer Science, Springer: Berlin Heidelberg, pp 280–293.
- SenSDurfeeEA formal study of distributed meeting schedulingGroup Decision and Negotiation19987326528910.1023/A:1008639617029
- Strasser B (2010). Speed dating: An algorithmic case study involving matching and scheduling. Study Thesis, Karlsruhe Institute of Technology.
- TautenhahnTOn unit time open shops with additional restrictionsMathematical Methods of Operations Research199643221523110.1007/BF01680373
- de WerraDSome models of graphs for scheduling sports competitionsDiscrete Applied Mathematics1988211476510.1016/0166-218X(88)90033-9