3 ms·
Pretty much any optimization algorithm (apart from brute force) can get stuck at a local optima. Often with seating plans it isn't possible to satisfy all crit
by hermitcrab 2y ago
Pretty much any optimization algorithm (apart from brute force) can get stuck at a local optima.
Often with seating plans it isn't possible to satisfy all criteria. Generally you can only sit next to 2 other people.
Combinatorial optimization problems are hard.