FoAM/scheduling
FoAM/scheduling
2
1
Fork 0
Code Issues 3 Pull requests Activity

other algorithms #1

New issue
Open
opened 2022-01-21 11:21:43 +00:00 by nik · 2 comments
nik commented 2022-01-21 11:21:43 +00:00
Owner
Copy link

"Can we arrange a series of sittings so that no two people share a table more than once? So that every pair of persons meets at least once? So that every pair of persons meets exactly once?"

incorporate, test or otherwise explore the notes at https://libarynth.org/table_seating and https://loosediary.wordpress.com/2021/12/20/may-i-sit-here/

"Can we arrange a series of sittings so that no two people share a table more than once? So that every pair of persons meets at least once? So that every pair of persons meets exactly once?" incorporate, test or otherwise explore the notes at https://libarynth.org/table_seating and https://loosediary.wordpress.com/2021/12/20/may-i-sit-here/
nik commented 2022-01-21 11:21:43 +00:00
Owner
Copy link

assigned to @nik

assigned to @nik
nik commented 2026-07-13 09:54:03 +00:00
Owner
Copy link

as of 7c94aada16

  • round robin (circle/polyogn)
  • constraint solver (via minizinc)
as of 7c94aada16deb31ee2458110eed069e342b58437 - round robin (circle/polyogn) - constraint solver (via minizinc)
Sign in to join this conversation.
No Branch/Tag specified
Branches Tags
endless
No results found.
Labels
Clear labels
No items
No labels
Milestone
Clear milestone
No items
No milestone
Projects
Clear projects
No items
No project
Assignees
Clear assignees
No assignees
1 participant
Notifications
Due date
The due date is invalid or out of range. Please use the format "yyyy-mm-dd".

No due date set.

Dependencies

No dependencies set.

Reference
FoAM/scheduling#1
No description provided.