Kenju Tateishi

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
Given a set I = {i | i = 1, 2, . . . , n} of current n items (for example, n green peppers) with their weights w<sub>i</sub> and priorities r<sub>i</sub>, a lexicographic bi-criteria combinatorial food packing problem asks to find a subset I' (&#x2286; I) so that the total weight &#x03A3;<sub>i&#x2208;I'</sub> w<sub>i</sub> is no less than a specified(More)
  • 1