Mathematics
Knapsack Problem
100%
Independence System
95%
Knapsack
89%
Matroid
79%
Programming
68%
Generalized Assignment Problem
56%
Dual Method
48%
Positive definite matrix
41%
Duality Gap
40%
Tournament
40%
Dual Problem
38%
Packing
35%
Necessary Conditions
32%
Color
30%
Sufficient Conditions
27%
Partition
27%
Optimal Solution
25%
Polynomial
25%
Facet
25%
Decompose
23%
Graph in graph theory
22%
Objective function
21%
Vertex of a graph
20%
Computational Results
19%
Family
17%
Maximal Clique
15%
Fixed point
15%
NP-complete problem
14%
Duality Theory
13%
Sharpness
13%
Nonnegativity
13%
Minimal Spanning Tree
13%
Reformulation
12%
Necessary
12%
Sort
12%
Domination
12%
Principal Submatrix
12%
Clique
11%
Class
11%
Converge
11%
Linear programming
11%
Colouring
10%
Greedy Algorithm
10%
Arc of a curve
10%
Subset
10%
Alike
9%
Polynomial time
9%
Trivial
9%
Pi
9%
Computational Complexity
8%
Business & Economics
Knapsack Problem
95%
Assignment Problem
87%
Polynomials
65%
Cutting Stock
59%
Partial Order
50%
Objective Function
40%
Decomposition
40%
Duality
39%
Defects
36%
Programming
35%
Node
35%
Graph
34%
Clique
33%
Optimal Solution
31%
Fixed Point
27%
Methodology
18%
Linear Programming
17%
Domination
16%
Coefficients
13%
Spanning Tree
13%
Industry
13%
Greedy Algorithm
13%
Compatibility
12%
Scheduling Problem
11%
Upper Bound
9%
Burden
6%
Agriculture & Biology
stable isotopes
38%
tracer techniques
36%
alkanes
35%
herbivores
31%
diet
23%
linear programming
16%
riverine habitat
14%
environmental management
11%
food webs
10%
methodology
9%
sampling
9%
simulation models
9%
managers
9%
organic matter
8%
Cervus elaphus
7%
climate change
7%
ecosystems
6%
Cistus ladanifer
5%
plant cuticle
5%