Mathematics
Algebraic Structure
100%
Application Area
50%
Approximate Solution
50%
Asymptotic Behavior
50%
Asymptotic Property
100%
Asymptotics
100%
Classical Concept
100%
Combinatorial Optimization Problem
50%
Commutative Semigroup
25%
Continuous Analog
100%
Convex Combination
33%
Convex Programming
100%
Dimensional Problem
50%
Duality Theory
100%
Eigenfunction
100%
Eigenvalue
100%
Eigenvector
100%
Exchange Algorithm
100%
Explicit Solution
100%
Feasible Set
33%
Feasible Solution
25%
Hamiltonian Cycle
100%
Heuristic Algorithm
50%
Hungarian Method
100%
Integer Programming
50%
Integer Programming Problem
100%
Linear Structure
50%
Matching Problem
100%
Mathematical Program
100%
Mathematical Programming
100%
Matrix (Mathematics)
100%
Maximum Degree
100%
Minimax
100%
Minimization Problem
25%
Nondominated Solution
25%
NP-hard Problem
50%
Objective Function
100%
Operations Research
100%
Optimality
100%
Ordered Structure
100%
Perturbation Theory
100%
Probability Theory
100%
Programming Problem
100%
Relative Error
100%
Ring Topology
100%
Strong Duality
50%
Total Cost
50%
Totally unimodular matrix
100%
Trace Form
50%
Transformation Method
100%
Computer Science
Combinatorial Optimization Problem
50%
Convex Combination
100%
Cost Coefficient
50%
Decision Problem
100%
Exact Algorithm
100%
Feasible Solution
20%
Location Problem
100%
Locational Decision
100%
Measures of Effectiveness
20%
Multicriteria
100%
Multiple Measure
20%
Nondominated Solution
20%
Numerical Example
20%
Perfect Matchings
25%
Practical Interest
25%
quadratic assignment problem
100%
Ring Network
100%
Solution Procedure
100%
Engineering
Application Area
50%
Approximate Solution
50%
Bound Procedure
100%
Combined Method
100%
Eigenvalue
100%
Extremal
100%
Flow Theory
100%
Objective Function
100%
Optimisation Problem
100%
Solution Method
50%
Solution Procedure
50%
Solution Technique
50%
Symmetric Case
50%