Mathematics
Minimax
100%
Convex Programming
100%
Integer Programming Problem
100%
Mathematical Programming
100%
Duality
100%
Integer
100%
Asymptotic Property
100%
Approximation
100%
Programming Problem
100%
Algebraic Structure
100%
Eigenvector
100%
Explicit Solution
100%
Matching Problem
100%
Continuous Analog
100%
Eigenfunction
100%
Hamiltonian Cycle
100%
Relative Error
100%
Computational
100%
Ordered Structure
100%
Mathematical Program
100%
Duality Theory
100%
Strong Duality
50%
Linear Structure
50%
Matrix (Mathematics)
50%
Dimensional Problem
33%
Asymptotic Behavior
33%
Heuristic Algorithm
33%
Feasible Set
33%
Perturbation Theory
33%
Exchange Algorithm
33%
Transformation Method
33%
Hungarian Method
33%
Totally unimodular matrix
33%
Ring Topology
28%
Feasible Solution
25%
Total Cost
25%
Commutative Semigroup
25%
Nondominated Solution
25%
Economic Activity
25%
Optimality Criterion
25%
Trace Form
25%
Perfect Matchings
25%
Classical Concept
20%
Maximum Degree
20%
NP-hard Problem
14%
Nets
14%
Computer Science
Reducibility
100%
quadratic assignment problem
100%
Booleans
100%
Locational Decision
100%
Decision Problem
100%
Convex Combination
100%
Multicriteria
100%
Time Complexity
100%
Topology
100%
Exact Algorithm
100%
Ring Network
100%
Location Problem
100%
Cost Coefficient
50%
Combinatorial Optimization Problem
50%
Perfect Matchings
25%
Practical Interest
25%
Measures of Effectiveness
20%
Multiple Measure
20%
Engineering
Objective Function
100%
Codes
100%
Eigenvalue
100%
Algorithm
100%
Networks (Circuits)
66%
Application Area
50%
Solution Technique
50%
Solution Procedure
50%
Symmetric Case
50%
Economics
50%
Approximate Solution
50%
Solution Method
50%
Give Access
50%
Facilities
50%
Buildings
50%
Zeros
33%
Combined Method
25%
Bound Procedure
25%
