g*****u
发帖数: 298 | 1 a set of objects (i from 1 to m), each has:
vi: the value of object i;
si: size of object i.
求选取a subset that can minimize the total value, subject to the condition
that total size greater than or equal to B.
请问有没有已知的近似解法？谢谢！ | p******h
发帖数: 1783 | 2 vi/si 排序
从小的开始选直到si总和大于等于B
【在 g*****u 的大作中提到】
: a set of objects (i from 1 to m), each has:
: vi: the value of object i;
: si: size of object i.
: 求选取a subset that can minimize the total value, subject to the condition
: that total size greater than or equal to B.
: 请问有没有已知的近似解法？谢谢！
| f******k
发帖数: 297 | 3 search for knapsack problem
【在 g*****u 的大作中提到】
: a set of objects (i from 1 to m), each has:
: vi: the value of object i;
: si: size of object i.
: 求选取a subset that can minimize the total value, subject to the condition
: that total size greater than or equal to B.
: 请问有没有已知的近似解法？谢谢！
|
|
