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