Finding the set of alternatives in discrete multicriterion problems

DOI10.1007/BF01074927zbMath0661.90084MaRDI QIDQ3812058

V. A. Perepelitsa, Ivan V. Sergienko

Publication date: 1987

Published in: Cybernetics (Search for Journal in Brave)

zbMATH Keywords

computational complexityspanning treepolynomial algorithmassignmentNP- harddiscrete multicriterion problemmulticriterion perfect matching

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Integer programming (90C10) Sensitivity, stability, parametric optimization (90C31)

Related Items (7)

Polynomial algorithms for finding the asymptotically optimum plan of the multiindex axial assignment problem ⋮ Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits ⋮ Completeness of vector discrete optimization problems ⋮ Multicriteria path and tree problems: discussion on exact algorithms and applications ⋮ On complete and quasi-complete two-criteria optimization problems on graphs ⋮ A Survey on Multiple Objective Minimum Spanning Tree Problems ⋮ Interval-parameter optimization problems on graphs

Cites Work

• The main properties of random graphs with a large number of vertices and edges
• Maximum matching of given weight in complete and complete bipartite graphs
• Bottleneck extrema
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Finding the set of alternatives in discrete multicriterion problems