Thanks, Jason! вс, 16 дек. 2018 г. в 06:00, Jason E. Aten <j.e.a...@gmail.com>: > > search for branch-and-bound; e.g. > https://www.geeksforgeeks.org/0-1-knapsack-using-branch-and-bound/ > > On Saturday, December 15, 2018 at 5:01:51 PM UTC-6, Vasiliy Tolstov wrote: >> >> Hi! i have task that have some resource constrains for example: >> Cpu Count >> Memory size >> Disk Size >> >> And have some servers, so i need optimal put this tasks on this >> servers (tightly) >> What is optimal algo for this case? As i see i need 3 dimensions, but >> i can't rotate items. Where i can read more info about solving bin >> packing/knapsack for such cases? >> Thanks! >> >> -- >> Vasiliy Tolstov, >> e-mail: v.to...@selfip.ru > > -- > You received this message because you are subscribed to the Google Groups > "golang-nuts" group. > To unsubscribe from this group and stop receiving emails from it, send an > email to golang-nuts+unsubscr...@googlegroups.com. > For more options, visit https://groups.google.com/d/optout.
-- Vasiliy Tolstov, e-mail: v.tols...@selfip.ru -- You received this message because you are subscribed to the Google Groups "golang-nuts" group. To unsubscribe from this group and stop receiving emails from it, send an email to golang-nuts+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/d/optout.
