Class information for:
Level 1: DEGREE CONSTRAINED MINIMUM SPANNING TREE//HOP CONSTRAINTS//BOUNDED DIAMETER MINIMUM SPANNING TREE PROBLEM

Basic class information
ID Publications Average number
of references		 Avg. shr. active
ref. in WoS
19564 435 25.2 37%


Bar chart of Publication_year

Last years might be incomplete

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 DEGREE CONSTRAINED MINIMUM SPANNING TREE Author keyword 13 80% 2% 8
2 HOP CONSTRAINTS Author keyword 10 57% 3% 12
3 BOUNDED DIAMETER MINIMUM SPANNING TREE PROBLEM Author keyword 9 83% 1% 5
4 INFORMAT EXAMINAT TEAM Address 8 100% 1% 5
5 QUADRATIC MINIMUM SPANNING TREE PROBLEM Author keyword 8 100% 1% 5
6 CAPACITATED TREES Author keyword 6 100% 1% 4
7 HOP CONSTRAINED PATHS Author keyword 6 100% 1% 4
8 CAPACITATED MINIMUM SPANNING TREE PROBLEM Author keyword 4 75% 1% 3
9 CIO DEIO Address 3 57% 1% 4
10 HOP CONSTRAINED TREES Author keyword 3 100% 1% 3

Web of Science journal categories

Author Key Words


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		 LCSH search Wikipedia search
1 DEGREE CONSTRAINED MINIMUM SPANNING TREE 13 80% 2% 8 Search DEGREE+CONSTRAINED+MINIMUM+SPANNING+TREE Search DEGREE+CONSTRAINED+MINIMUM+SPANNING+TREE
2 HOP CONSTRAINTS 10 57% 3% 12 Search HOP+CONSTRAINTS Search HOP+CONSTRAINTS
3 BOUNDED DIAMETER MINIMUM SPANNING TREE PROBLEM 9 83% 1% 5 Search BOUNDED+DIAMETER+MINIMUM+SPANNING+TREE+PROBLEM Search BOUNDED+DIAMETER+MINIMUM+SPANNING+TREE+PROBLEM
4 QUADRATIC MINIMUM SPANNING TREE PROBLEM 8 100% 1% 5 Search QUADRATIC+MINIMUM+SPANNING+TREE+PROBLEM Search QUADRATIC+MINIMUM+SPANNING+TREE+PROBLEM
5 CAPACITATED TREES 6 100% 1% 4 Search CAPACITATED+TREES Search CAPACITATED+TREES
6 HOP CONSTRAINED PATHS 6 100% 1% 4 Search HOP+CONSTRAINED+PATHS Search HOP+CONSTRAINED+PATHS
7 CAPACITATED MINIMUM SPANNING TREE PROBLEM 4 75% 1% 3 Search CAPACITATED+MINIMUM+SPANNING+TREE+PROBLEM Search CAPACITATED+MINIMUM+SPANNING+TREE+PROBLEM
8 HOP CONSTRAINED TREES 3 100% 1% 3 Search HOP+CONSTRAINED+TREES Search HOP+CONSTRAINED+TREES
9 ONE MAX TREE PROBLEM 3 100% 1% 3 Search ONE+MAX+TREE+PROBLEM Search ONE+MAX+TREE+PROBLEM
10 CAPACITATED MINIMUM SPANNING TREE 3 50% 1% 4 Search CAPACITATED+MINIMUM+SPANNING+TREE Search CAPACITATED+MINIMUM+SPANNING+TREE

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 SPANNING TREE PROBLEM 7 19% 7% 31
2 HOP CONSTRAINTS 6 47% 2% 9
3 EDGE EXCHANGES 4 75% 1% 3
4 HOP CONSTRAINED PATHS 4 75% 1% 3
5 COMMUNICATION SPANNING TREE 2 67% 0% 2
6 DANDELION CODE 2 50% 1% 3
7 TOPOLOGICAL DESIGN 2 20% 2% 9
8 PILOT METHOD 2 43% 1% 3
9 CONCENTRATOR NETWORKS 1 100% 0% 2
10 PRUFER CODES 1 100% 0% 2

Journals

Reviews


Title Publ. year Cit. Active references % act. ref.
to same field
Multi-start methods for combinatorial optimization 2013 8 20 20%
Topological network design: A survey 2009 7 5 60%
Combinatorial optimization in system configuration design 2009 9 188 8%
Modular system synthesis: Example for composite packaged software 2005 8 45 2%
GEOGRAPHICAL INFORMATION-SYSTEMS 1993 1 17 6%

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 INFORMAT EXAMINAT TEAM 8 100% 1.1% 5
2 CIO DEIO 3 57% 0.9% 4
3 INFORMAT SYST EXAMINAT TEAM 2 67% 0.5% 2
4 POMS 2 67% 0.5% 2
5 ALGORITHMS OPTIMIZAT 1 17% 1.6% 7
6 DEIO CIO 1 22% 1.1% 5
7 INFORMAT SYST 1 1 30% 0.7% 3
8 DIPARTIMENTO INGN ELETTR INGN INFORMAT 1 50% 0.2% 1
9 KIPO 1 50% 0.2% 1
10 MAT IRD 1 50% 0.2% 1

Related classes at same level (level 1)


Rank Relatedness score Related classes
1 0.0000255095 FIXED CHARGE TRANSPORTATION PROBLEM//FIXED CHARGE TRANSPORTATION//FIXED CHARGE NETWORK FLOW PROBLEM
2 0.0000253248 HUB LOCATION//SERVICE NETWORK DESIGN//HUB LOCATION PROBLEMS
3 0.0000225230 MULTICAST ROUTING//QOS ROUTING//GROUP MULTICAST ROUTING
4 0.0000162123 APPROXIMATION ALGORITHMS//RANGE ASSIGNMENT//MINIMUM ENERGY BROADCAST
5 0.0000117631 CELL ASSIGNMENT//THIRD GENERATION 3G MOBILE NETWORKS//RADIO NETWORK DESIGN
6 0.0000108499 INVERSE OPTIMIZATION//OPTIMIZAT DISCRETE MATH//BALANCED OPTIMIZATION
7 0.0000095351 ARC ROUTING//CAPACITATED ARC ROUTING PROBLEM//ARC ROUTING PROBLEMS
8 0.0000087528 SUPPLY CHAIN NETWORK DESIGN//SUPPLY CHAIN DESIGN//FACILITY LOCATION
9 0.0000085758 ORDERED FACTORIZATIONS//FACTORISATIO NUMERORUM//IMPROPER EDGE
10 0.0000080996 CLIQUE RELAXATIONS//MAXIMUM CLIQUE PROBLEM//MAXIMUM CLIQUE