The problem of the optimal biobjective spanning tree

DOI10.1016/S0377-2217(97)00391-3zbMATH Open0937.90112OpenAlexW1985130949MaRDI QIDQ1806877FDOQ1806877

R. M. Ramos, C. González-Martín, Sergio Fernando Alonso Rodríguez, Joaquín Sicilia Rodríguez

Publication date: 8 November 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00391-3

Recommendations

• On spanning tree problems with multiple objectives
• Publication:4733693
• scientific article; zbMATH DE number 3891405
• scientific article; zbMATH DE number 3980505

zbMATH Keywords

spanning treemulti-criteria analysisminimum cost spanning treebiobjective optimal cost spanning tree

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Programming involving graphs or networks (90C35)

Cites Work

• Title not available (Why is that?)
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Finding All Spanning Trees of Directed and Undirected Graphs
• Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
• EFFICIENTLY SCANNING ALL SPANNING TREES OF AN UNDIRECTED GRAPH
• On spanning tree problems with multiple objectives
• On the History of the Minimum Spanning Tree Problem
• Efficient spanning trees
• An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs
• Structure of Efficient Sets for Convex Objectives
• Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs

Cited In (43)

• A biobjective Dijkstra algorithm
• Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets
• Optimality conditions in preference-based spanning tree problems
• Title not available (Why is that?)
• A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
• A preference-based approach to spanning trees and shortest paths problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Heuristic and exact algorithms for the spanning tree detection problem
• Computation of ideal and Nadir values and implications for their use in MCDM methods.
• Title not available (Why is that?)
• A multi-agent transgenetic algorithm for the bi-objective spanning tree problem
• Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations
• Finding all nondominated points of multi-objective integer programs
• Computing all efficient solutions of the biobjective minimum spanning tree problem
• Ordered weighted average optimization in multiobjective spanning tree problem
• COUNTING SPANNING TREES IN PRISM AND ANTI-PRISM GRAPHS
• Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors.
• Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems
• A new approach for the multiobjective minimum spanning tree
• Empirical study of exact algorithms for the multi-objective spanning tree
• Multicriteria path and tree problems: discussion on exact algorithms and applications
• Exact algorithms for OWA-optimization in multiobjective spanning tree problems
• Title not available (Why is that?)
• Dynamic programming for spanning tree problems: application to the multi-objective case
• Finding multi-objective supported efficient spanning trees
• Title not available (Why is that?)
• Two phase algorithms for the bi-objective assignment problem
• A survey of recent developments in multiobjective optimization
• Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs
• On spanning tree problems with multiple objectives
• Combining linear and nonlinear objectives in spanning tree problems
• Branch-and-bound and objective branching with three or more objectives
• Modeling and solving the bi-objective minimum diameter-cost spanning tree problem
• An analysis on recombination in multi-objective evolutionary optimization
• Multi-objective branch and bound
• Two‐phase strategies for the bi‐objective minimum spanning tree problem
• A GRASP algorithm for the multi-criteria minimum spanning tree problem
• Spanning Trees and Optimization Problems
• A Survey on Multiple Objective Minimum Spanning Tree Problems
• Title not available (Why is that?)
• Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach
• Efficient spanning trees

This page was built for publication: The problem of the optimal biobjective spanning tree

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