| 词汇 | knapsack |
| 释义 | knapsack noun[ C ] UKold-fashioned or USuk /ˈnæp.sæk/ us /ˈnæp.sæk/ a bag carried on the back or over the shoulder, used especially by people who go walking or climbing for carrying food, clothes, etc.（徒步旅行者或登山者用的帆布或皮制的）小背包 Compare rucksack haversackold-fashioned backpacknoun Westend61/GettyImages Containers for carrying personal possessions attaché case baggage billfold bindle briefcase excess baggage garment bag grip hand luggage handbag hatbox pannier pocketbook sack saddlebag satchel schoolbag shopping bag sling sponge bag knapsack | American Dictionaryknapsack noun[ C ] us/ˈnæpˌsæk/ a small bag with straps that can hold it against a person’s back, leaving the arms free Examples of knapsackknapsack We gravitate to our knapsacks, the session comes to an end, and the clock begins to measure time once again. In general, identifying non-trivial strong valid inequalities is not obvious even for knapsack relaxations. Solving large knapsack problems with a genetic algorithm. These have to be applied with a knapsack sprayer. Some facet-defining inequalities of these knapsack relaxations are easy to identify. Both treatments were applied in 200 litres water/ha using a knapsack sprayer at a pressure of 2 bars. Pheromone solutions were applied by means of a manual knapsack sprayer. Finding the shortest path corresponds to minimising the cost of placing items in the knapsack, and therefore maximising the profit. The general problem of ordering categories to minimize wasted gaps in allocation is somewhat similar to a knapsack problem. However, we can simplify the problem further, so that finding such inequalities is easier, and then build from these inequalities to obtain facets of the knapsack polytopes. Pmax represents the profit of the solution and cap is the knapsack size. Thus, for a large knapsack of 20,000 elements, the adaptive penalty function used in this research computes the minimum and the maximum penalties as approximately 1 and 10, respectively. It closely corresponds to the knapsack problem. What makes a vector solution x infeasible is that the total weight of the individual x has exceeded the knapsack capacity. Crowder et al. (1983) suggested using strong inequalities derived from the individual linear constraints of the problem (knapsack relaxations). These examples are from corpora and from sources on the web. Any opinions in the examples do not represent the opinion of the Cambridge Dictionary editors or of Cambridge University Press or its licensors. |
| 随便看 |
反思网英语在线翻译词典收录了377474条英语词汇在线翻译词条，基本涵盖了全部常用英语词汇的中英文双语翻译及用法，是英语学习的有利工具。