search

BrcRs / table-arrangement

This project allows you to define and solve your own table arrangement problem thanks to an easy model format.
GNU General Public License v3.0
1 stars 0 forks source link

Implement the Branch and Bound (without LP) #16

Open BrcRs opened 2 years ago

BrcRs commented 2 years ago

Fix the people and compute sup bound with the max value possible for each remaining guest to place + actual current value ant the inferior bound with the worst values, similarly.

BrcRs commented 2 years ago

explore the branches with highest sup bound forget not promising branches

BrcRs commented 2 years ago

this should have better results than the swap method