{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T19:02:30Z","timestamp":1767207750554,"version":"build-2238731810"},"posted":{"date-parts":[[2018,12,8]]},"group-title":"PeerJ Preprints","reference-count":0,"publisher":"PeerJ","license":[{"start":{"date-parts":[[2018,12,8]],"date-time":"2018-12-08T00:00:00Z","timestamp":1544227200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>An appropriate seating plan is an important prerequisite for any good party be it a formal wedding or an informal dinner. Yet anyone who has designed a seating plan knows that it can prove frustratingly difficult to find a solution that solves the large number of formal, physical and personal constraints associated. Here I present a flexible algorithm for automating the task. The algorithm matches guests to seats taking into account constraints provided through a dissimilarity matrix calculated, for example, using answers to questions designed to classify personality, as well as other formal or informal constraints.<\/jats:p>","DOI":"10.7287\/peerj.preprints.27420v1","type":"posted-content","created":{"date-parts":[[2018,12,8]],"date-time":"2018-12-08T16:49:23Z","timestamp":1544287763000},"source":"Crossref","is-referenced-by-count":0,"title":["An automatic seating plan algorithm"],"prefix":"10.7287","author":[{"given":"Kresten","family":"Lindorff-Larsen","sequence":"first","affiliation":[{"name":"Linderstr\u00f8m-Lang Centre for Protein Science, Department of Biology, University of Copenhagen, Copenhagen, Denmark"}]}],"member":"4443","container-title":[],"original-title":[],"link":[{"URL":"https:\/\/peerj.com\/preprints\/27420v1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/peerj.com\/preprints\/27420v1.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/peerj.com\/preprints\/27420v1.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/peerj.com\/preprints\/27420v1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,23]],"date-time":"2019-12-23T20:09:51Z","timestamp":1577131791000},"score":1,"resource":{"primary":{"URL":"https:\/\/peerj.com\/preprints\/27420v1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,8]]},"references-count":0,"aliases":["10.7287\/peerj.preprints.27420"],"URL":"https:\/\/doi.org\/10.7287\/peerj.preprints.27420v1","relation":{},"subject":[],"published":{"date-parts":[[2018,12,8]]},"subtype":"preprint"}}