Combining linear and nonlinear objectives in spanning tree problems

DOI10.1023/A:1009854922371zbMATH Open1028.90046OpenAlexW1585405227MaRDI QIDQ1583705FDOQ1583705

Authors: Mauro Dell'Amico, Francesco Maffioli 

Publication date: 30 October 2000

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1009854922371

Recommendations

• On spanning tree problems with multiple objectives
• scientific article; zbMATH DE number 1748022
• Publication:4733693
• scientific article; zbMATH DE number 3980505
• The problem of the optimal biobjective spanning tree

zbMATH Keywords

computational complexityspanning treemulticriteria problemcumulative function

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Programming involving graphs or networks (90C35) Trees (05C05) Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)

Cited In (6)

• Title not available (Why is that?)
• Kruskal with embedded C-semirings to solve MST problems with partially-ordered costs
• Dynamic programming for spanning tree problems: application to the multi-objective case
• Combinatorial optimization in system configuration design
• On weighting two criteria with a parameter in combinatorial optimization problems
• A Survey on Multiple Objective Minimum Spanning Tree Problems

This page was built for publication: Combining linear and nonlinear objectives in spanning tree problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1583705)