Class information for: |
Basic class information |
ID | Publications | Average number of references |
Avg. shr. active ref. in WoS |
---|---|---|---|
21986 | 341 | 15.3 | 44% |
Classes in level above (level 2) |
ID, lev. above |
Publications | Label for level above |
---|---|---|
224 | 19926 | VEHICLE ROUTING//COMPUTERS & OPERATIONS RESEARCH//EUROPEAN JOURNAL OF OPERATIONAL RESEARCH |
Terms with highest relevance score |
Rank | Term | Type of term | Relevance score (tfidf) |
Class's shr. of term's tot. occurrences |
Shr. of publ. in class containing term |
Num. of publ. in class |
---|---|---|---|---|---|---|
1 | INVERSE OPTIMIZATION | Author keyword | 18 | 36% | 12% | 40 |
2 | OPTIMIZAT DISCRETE MATH | Address | 12 | 58% | 4% | 14 |
3 | BALANCED OPTIMIZATION | Author keyword | 6 | 80% | 1% | 4 |
4 | INVERSE COMBINATORIAL OPTIMIZATION | Author keyword | 6 | 71% | 1% | 5 |
5 | INVERSE OPTIMAL VALUE PROBLEM | Author keyword | 6 | 100% | 1% | 4 |
6 | INVERSE OPTIMIZATION PROBLEM | Author keyword | 5 | 60% | 2% | 6 |
7 | STRONGLY POLYNOMIAL ALGORITHM | Author keyword | 5 | 37% | 3% | 10 |
8 | BOTTLENECK PROBLEMS | Author keyword | 4 | 47% | 2% | 7 |
9 | MINIMUM COST CIRCULATION | Author keyword | 3 | 50% | 1% | 5 |
10 | COMPOSITE CONCAVE PROGRAMMING | Author keyword | 3 | 100% | 1% | 3 |
Web of Science journal categories |
Author Key Words |
Key Words Plus |
Rank | Web of Science journal category | Relevance score (tfidf) |
Class's shr. of term's tot. occurrences |
Shr. of publ. in class containing term |
Num. of publ. in class |
---|---|---|---|---|---|
1 | SHORTEST PATHS PROBLEM | 15 | 88% | 2% | 7 |
2 | SPANNING TREE PROBLEMS | 4 | 47% | 2% | 7 |
3 | NETWORK IMPROVEMENT PROBLEM | 4 | 75% | 1% | 3 |
4 | IMPROVEMENT PROBLEM | 3 | 100% | 1% | 3 |
5 | BALANCED OPTIMIZATION | 2 | 67% | 1% | 2 |
6 | CUT PROBLEMS | 2 | 67% | 1% | 2 |
7 | LINFINITY NORM | 2 | 67% | 1% | 2 |
8 | HAMMING DISTANCE | 2 | 29% | 1% | 5 |
9 | UPGRADING NODES | 1 | 100% | 1% | 2 |
10 | WEIGHT REDUCTION PROBLEMS | 1 | 100% | 1% | 2 |
Journals |
Reviews |
Address terms |
Rank | Address term | Relevance score (tfidf) |
Class's shr. of term's tot. occurrences |
Shr. of publ. in class containing term |
Num. of publ. in class |
---|---|---|---|---|---|
1 | OPTIMIZAT DISCRETE MATH | 12 | 58% | 4.1% | 14 |
2 | CODE SMG | 1 | 40% | 0.6% | 2 |
3 | DIGITAL SPACE TECHNOL | 1 | 33% | 0.6% | 2 |
4 | CLIN DECIS SUPPORT SOLUT | 0 | 33% | 0.3% | 1 |
5 | MANAGEMENT SCI UNIT | 0 | 25% | 0.3% | 1 |
6 | MANAGEMENT DECIS INFORMAT SYST | 0 | 11% | 0.6% | 2 |
7 | OPERAT CONTROL THEORY | 0 | 13% | 0.3% | 1 |
8 | TIBETAN INFORMAT PROC | 0 | 13% | 0.3% | 1 |
9 | B TIST UNIV UNITED INT | 0 | 100% | 0.3% | 1 |
10 | BUSINESSS MARKET | 0 | 100% | 0.3% | 1 |
Related classes at same level (level 1) |
Rank | Relatedness score | Related classes |
---|---|---|
1 | 0.0000218489 | GENERALIZED ASSIGNMENT PROBLEM//GENERALIZED ASSIGNMENT//LABELED MATCHING |
2 | 0.0000145265 | BASE POLYHEDRON//DISCRETE CONVEX FUNCTION//SUBMODULAR FUNCTION |
3 | 0.0000137256 | DISCRETE DECISION PROCESS//ECON ENGN//MULTIOBJECTIVE DYNAMIC PROGRAMMING |
4 | 0.0000133289 | MIN MAX REGRET//MINMAX REGRET//FUZZY MATROID |
5 | 0.0000127408 | MULTIDIMENSIONAL KNAPSACK PROBLEM//KNAPSACK PROBLEM//MULTIDIMENSIONAL KNAPSACK |
6 | 0.0000114764 | DYNAMIC GRAPH ALGORITHMS//REPLACEMENT PATHS//SHORTEST PATHS |
7 | 0.0000108920 | BILEVEL PROGRAMMING//BILEVEL LINEAR PROGRAMMING//STACKELBERG SOLUTIONS |
8 | 0.0000108499 | DEGREE CONSTRAINED MINIMUM SPANNING TREE//HOP CONSTRAINTS//BOUNDED DIAMETER MINIMUM SPANNING TREE PROBLEM |
9 | 0.0000088535 | MULTIOBJECTIVE SHORTEST PATH PROBLEM//LABELING ALGORITHMS//SHORTEST PATH PROBLEM |
10 | 0.0000083399 | APPROXIMATION ALGORITHMS//RANGE ASSIGNMENT//MINIMUM ENERGY BROADCAST |