Solving combinatorial problems with combined Min-Max-Min-Sum objective and applications
Mathematical Programming: Series A and B
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
On combined minmax-minsum optimization
Computers and Operations Research
An investigation of linear convolution of criteria in multicriteria discrete programming
Computational Mathematics and Mathematical Physics
On some multicriteria arborescence problems: complexity and algorithms
Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
On bicriterion minimal spanning trees: an approximation
Computers and Operations Research
Computational Mathematics and Mathematical Physics
The Constrained Minimum Spanning Tree Problem (Extended Abstract)
SWAT '96 Proceedings of the 5th Scandinavian Workshop on Algorithm Theory
Multicriteria Optimization
A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem
Operations Research Letters
A bi-criteria approach for Steiner's tree problems in communication networks
Proceedings of the 2011 International Workshop on Modeling, Analysis, and Control of Complex Networks
A bi-criteria algorithm for multipoint-to-multipoint virtual connections in transport networks
Proceedings of the 7th International Conference on Network and Services Management
| Hi-index | 0.00 |
We review the literature on minimum spanning tree problems with two or more objective functions (MOST) each of which is of the sum or bottleneck type. Theoretical aspects of different types of this problem are summarized and available algorithms are categorized and explained. The paper includes a concise tabular presentation of all the reviewed papers.