scientific article; zbMATH DE number 4119973
From MaRDI portal
zbMATH Open0683.90094MaRDI QIDQ4733693FDOQ4733693
Authors: V. A. Perepelitsa, V. A. Emelichev 
Publication date: 1988
Title of this publication is not available (Why is that?)
Recommendations
spanning treesNP-hardmultiobjective problemsexponential computational complexityhierarchy of complexities
Programming involving graphs or networks (90C35) Trees (05C05) Analysis of algorithms and problem complexity (68Q25) Sensitivity, stability, parametric optimization (90C31)
Cited In (18)
- Decision making with multiple objectives using GAI networks
- Optimization problems in multiple subtree graphs
- Choquet-based optimisation in multiobjective shortest path and spanning tree problems
- Title not available (Why is that?)
- On combinatorial vector optimization problems
- Title not available (Why is that?)
- Computing all efficient solutions of the biobjective minimum spanning tree problem
- Completeness of vector discrete optimization problems
- Title not available (Why is that?)
- Exact algorithms for OWA-optimization in multiobjective spanning tree problems
- Finding multi-objective supported efficient spanning trees
- Choquet optimal set in biobjective combinatorial optimization
- A decision-theoretic approach to robust optimization in multivalued graphs
- On spanning tree problems with multiple objectives
- Combining linear and nonlinear objectives in spanning tree problems
- On solving bi-objective constrained minimum spanning tree problems
- A Survey on Multiple Objective Minimum Spanning Tree Problems
- Element perturbation problems of optimum spanning trees with two-parameter objectives
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4733693)
