scientific article; zbMATH DE number 4119973
From MaRDI portal
Publication:4733693
zbMath0683.90094MaRDI QIDQ4733693
V. A. Perepelitsa, Vladimir A. Emelichev
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
NP-hardspanning treesmultiobjective problemsexponential computational complexityhierarchy of complexities
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Sensitivity, stability, parametric optimization (90C31)
Related Items (6)
A decision-theoretic approach to robust optimization in multivalued graphs ⋮ Choquet optimal set in biobjective combinatorial optimization ⋮ Completeness of vector discrete optimization problems ⋮ Choquet-based optimisation in multiobjective shortest path and spanning tree problems ⋮ On solving bi-objective constrained minimum spanning tree problems ⋮ Decision making with multiple objectives using GAI networks
This page was built for publication:
