Matemáticas
Approximate String Matching
100%
Approximation Algorithms
26%
Approximation Scheme
30%
Attribute
28%
Bicliques
42%
Bundle
25%
Business
21%
Combinatorial Algorithms
30%
Continuous Time
25%
Costs
48%
Cover
29%
Demand
17%
Deterministic Algorithm
16%
Dynamic Games
18%
Dynamic Programming
19%
Economics
26%
Edit Distance
24%
Efficient Algorithms
21%
Experimental Results
17%
Family
20%
Game
28%
Half line
26%
Hardness
30%
Hitting Set
60%
Independent Set
29%
Inspection
32%
Integer
23%
Integer Program
27%
Jump number
46%
Lot Sizing
42%
Lower bound
22%
Maintenance
34%
Maintenance Scheduling
53%
Matching Problem
35%
Maximum Independent Set
50%
Min-max
31%
Model
23%
NP-complete problem
19%
Optimization
22%
Piecewise Linear
17%
Polynomial Algorithm
33%
Randomized Algorithms
16%
Rectangle
23%
Robustness
24%
Scheduling Problem
30%
Set of points
18%
Setup Cost
44%
Stackelberg Game
48%
Text
16%
Threshold Parameter
22%
Economía y empresa
Backward Induction
7%
Cournot Competition
18%
Dynamic Games
20%
Equilibrium Refinements
11%
Equivalence
5%
Independence of Irrelevant Alternatives
10%
Inspection
29%
Inspection Game
20%
Inventory Cost
8%
Linear Program
6%
Literature Review
8%
Lot Sizing
34%
Market Price
6%
Market Share
11%
Multinomial Logit Model
8%
Nash Equilibrium
19%
NP-hard
7%
Placing
9%
Polynomials
14%
Potential Games
10%
Production Cost
6%
Profit Share
19%
Replication
7%
Scheduling Problem
26%
Setup Cost
8%
Stackelberg
6%
Stackelberg Game
34%
Static Game
33%
Transportation Problem
8%
Upper Bound
10%
Variable Cost
8%
Ingeniería y ciencia de los materiales
Approximation algorithms
32%
Chemical analysis
19%
Combinatorial optimization
21%
Computational complexity
6%
Cost functions
5%
Costs
34%
Dynamic programming
11%
Economics
19%
Factorization
9%
Hardness
23%
Inspection
22%
Linear programming
6%
Machinery
9%
NP-hard
15%
Polynomials
49%
Profitability
13%
Set theory
18%
