Class information for: |
Basic class information |
Class id | #P | Avg. number of references |
Database coverage of references |
---|---|---|---|
16159 | 670 | 21.2 | 32% |
Hierarchy of classes |
The table includes all classes above and classes immediately below the current class. |
Terms with highest relevance score |
rank | Term | termType | Chi square | Shr. of publ. in class containing term |
Class's shr. of term's tot. occurrences |
#P with term in class |
---|---|---|---|---|---|---|
1 | MAXIMUM FLOW | authKW | 360126 | 5% | 23% | 35 |
2 | STRONGLY POLYNOMIAL | authKW | 303819 | 1% | 67% | 10 |
3 | NETWORK FLOW | authKW | 281717 | 9% | 11% | 58 |
4 | NETWORK SIMPLEX ALGORITHM | authKW | 263671 | 1% | 64% | 9 |
5 | GENERALIZED CIRCULATION | authKW | 227869 | 1% | 100% | 5 |
6 | STRONGLY POLYNOMIAL ALGORITHM | authKW | 186073 | 2% | 29% | 14 |
7 | GENERALIZED MAXIMUM FLOW | authKW | 182295 | 1% | 100% | 4 |
8 | MAXIMUM FLOW PROBLEM | authKW | 157138 | 1% | 34% | 10 |
9 | MAX FLOW PROBLEM | authKW | 142415 | 1% | 63% | 5 |
10 | EPSILON RELAXATION METHOD | authKW | 136722 | 0% | 100% | 3 |
Web of Science journal categories |
Rank | Term | Chi square | Shr. of publ. in class containing term |
Class's shr. of term's tot. occurrences |
#P with term in class |
---|---|---|---|---|---|
1 | Operations Research & Management Science | 41044 | 56% | 0% | 374 |
2 | Mathematics, Applied | 4814 | 34% | 0% | 228 |
3 | Computer Science, Software Engineering | 2960 | 16% | 0% | 105 |
4 | Computer Science, Theory & Methods | 1968 | 15% | 0% | 103 |
5 | Computer Science, Hardware & Architecture | 1346 | 8% | 0% | 55 |
6 | Management | 903 | 8% | 0% | 56 |
7 | Engineering, Industrial | 522 | 5% | 0% | 34 |
8 | Computer Science, Interdisciplinary Applications | 364 | 7% | 0% | 46 |
9 | Computer Science, Information Systems | 308 | 6% | 0% | 41 |
10 | Logic | 42 | 1% | 0% | 4 |
Address terms |
Rank | Term | Chi square | Shr. of publ. in class containing term |
Class's shr. of term's tot. occurrences |
#P with term in class |
---|---|---|---|---|---|
1 | OURCE ANAL BRANCH | 91148 | 0% | 100% | 2 |
2 | MARWARI | 58592 | 0% | 43% | 3 |
3 | BOUYGUES TELECOM | 45574 | 0% | 100% | 1 |
4 | BUSINESS ADM GEN BUSINESS | 45574 | 0% | 100% | 1 |
5 | BUSINESS GEN BUSINESS | 45574 | 0% | 100% | 1 |
6 | CADET COMMAND | 45574 | 0% | 100% | 1 |
7 | CAMPUS CLERMONT FERRAND LESS CEZEAUX | 45574 | 0% | 100% | 1 |
8 | CNRSLIM | 45574 | 0% | 100% | 1 |
9 | ESA CNRS 6077 | 45574 | 0% | 100% | 1 |
10 | GEENIE CHIM | 45574 | 0% | 100% | 1 |
Journals |
Rank | Term | Chi square | Shr. of publ. in class containing term |
Class's shr. of term's tot. occurrences |
#P with term in class |
---|---|---|---|---|---|
1 | MATHEMATICAL PROGRAMMING STUDY | 69383 | 3% | 8% | 19 |
2 | MATHEMATICAL PROGRAMMING | 36572 | 7% | 2% | 50 |
3 | NETWORKS | 36371 | 6% | 2% | 37 |
4 | OPERATIONS RESEARCH LETTERS | 26198 | 6% | 1% | 40 |
5 | MATHEMATICS OF OPERATIONS RESEARCH | 13901 | 4% | 1% | 24 |
6 | JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN | 13322 | 2% | 2% | 15 |
7 | OPERATIONS RESEARCH | 9050 | 4% | 1% | 26 |
8 | COMPUTERS & OPERATIONS RESEARCH | 5554 | 4% | 1% | 24 |
9 | ALGORITHMICA | 4462 | 2% | 1% | 15 |
10 | EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 4200 | 6% | 0% | 37 |
Author Key Words |
Rank | Term | Chi square | Shr. of publ. in class containing term |
Class's shr. of term's tot. occurrences |
#P with term in class |
LCSH search | Wikipedia search |
---|---|---|---|---|---|---|---|
1 | MAXIMUM FLOW | 360126 | 5% | 23% | 35 | Search MAXIMUM+FLOW | Search MAXIMUM+FLOW |
2 | STRONGLY POLYNOMIAL | 303819 | 1% | 67% | 10 | Search STRONGLY+POLYNOMIAL | Search STRONGLY+POLYNOMIAL |
3 | NETWORK FLOW | 281717 | 9% | 11% | 58 | Search NETWORK+FLOW | Search NETWORK+FLOW |
4 | NETWORK SIMPLEX ALGORITHM | 263671 | 1% | 64% | 9 | Search NETWORK+SIMPLEX+ALGORITHM | Search NETWORK+SIMPLEX+ALGORITHM |
5 | GENERALIZED CIRCULATION | 227869 | 1% | 100% | 5 | Search GENERALIZED+CIRCULATION | Search GENERALIZED+CIRCULATION |
6 | STRONGLY POLYNOMIAL ALGORITHM | 186073 | 2% | 29% | 14 | Search STRONGLY+POLYNOMIAL+ALGORITHM | Search STRONGLY+POLYNOMIAL+ALGORITHM |
7 | GENERALIZED MAXIMUM FLOW | 182295 | 1% | 100% | 4 | Search GENERALIZED+MAXIMUM+FLOW | Search GENERALIZED+MAXIMUM+FLOW |
8 | MAXIMUM FLOW PROBLEM | 157138 | 1% | 34% | 10 | Search MAXIMUM+FLOW+PROBLEM | Search MAXIMUM+FLOW+PROBLEM |
9 | MAX FLOW PROBLEM | 142415 | 1% | 63% | 5 | Search MAX+FLOW+PROBLEM | Search MAX+FLOW+PROBLEM |
10 | EPSILON RELAXATION METHOD | 136722 | 0% | 100% | 3 | Search EPSILON+RELAXATION+METHOD | Search EPSILON+RELAXATION+METHOD |
Core articles |
The table includes core articles in the class. The following variables is taken into account for the relevance score of an article in a cluster c: (1) Number of references referring to publications in the class. (2) Share of total number of active references referring to publications in the class. (3) Age of the article. New articles get higher score than old articles. (4) Citation rate, normalized to year. |
Rank | Reference | # ref. in cl. |
Shr. of ref. in cl. |
Citations |
---|---|---|---|---|
1 | KOVACS, P , (2015) MINIMUM-COST FLOW ALGORITHMS: AN EXPERIMENTAL EVALUATION.OPTIMIZATION METHODS & SOFTWARE. VOL. 30. ISSUE 1. P. 94 -127 | 24 | 77% | 4 |
2 | SHIGO, M , (2004) A SURVEY OF COMBINATORIAL MAXIMUM FLOW ALGORITHMS ON A NETWORK WITH GAINS.JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN. VOL. 47. ISSUE 4. P. 244 -264 | 28 | 93% | 3 |
3 | CALISKAN, C , (2011) A SPECIALIZED NETWORK SIMPLEX ALGORITHM FOR THE CONSTRAINED MAXIMUM FLOW PROBLEM.EUROPEAN JOURNAL OF OPERATIONAL RESEARCH. VOL. 210. ISSUE 2. P. 137-147 | 18 | 90% | 1 |
4 | VEGH, LA , (2014) CONCAVE GENERALIZED FLOWS WITH APPLICATIONS TO MARKET EQUILIBRIA.MATHEMATICS OF OPERATIONS RESEARCH. VOL. 39. ISSUE 2. P. 573-596 | 19 | 73% | 1 |
5 | RESTREPO, M , WILLIAMSON, DP , (2009) A SIMPLE GAP-CANCELING ALGORITHM FOR THE GENERALIZED MAXIMUM FLOW PROBLEM.MATHEMATICAL PROGRAMMING. VOL. 118. ISSUE 1. P. 47 -74 | 16 | 94% | 3 |
6 | TSENG, P , BERTSEKAS, DP , (2000) AN EPSILON-RELAXATION METHOD FOR SEPARABLE CONVEX COST GENERALIZED NETWORK FLOW PROBLEMS.MATHEMATICAL PROGRAMMING. VOL. 88. ISSUE 1. P. 85-104 | 17 | 100% | 13 |
7 | GHIYASVAND, M , (2016) A GEOMETRICAL EXPLANATION FOR THE OPTIMALITY CONCEPT OF MINIMUM COST FLOWS.SCIENTIA IRANICA. VOL. 23. ISSUE 6. P. 3063 -3071 | 12 | 92% | 0 |
8 | ORLIN, JB , (1997) A POLYNOMIAL TIME PRIMAL NETWORK SIMPLEX ALGORITHM FOR MINIMUM COST FLOWS.MATHEMATICAL PROGRAMMING. VOL. 78. ISSUE 2. P. 109-129 | 17 | 89% | 28 |
9 | BAHCECI, U , FEYZIOGLU, O , (2012) A NETWORK SIMPLEX BASED ALGORITHM FOR THE MINIMUM COST PROPORTIONAL FLOW PROBLEM WITH DISCONNECTED SUBNETWORKS.OPTIMIZATION LETTERS. VOL. 6. ISSUE 6. P. 1173-1184 | 10 | 100% | 2 |
10 | DELL'AMICO, M , TOTH, P , (2000) ALGORITHMS AND CODES FOR DENSE ASSIGNMENT PROBLEMS: THE STATE OF THE ART.DISCRETE APPLIED MATHEMATICS. VOL. 100. ISSUE 1-2. P. 17 -48 | 18 | 69% | 40 |
Classes with closest relation at Level 1 |