The problem of the optimal biobjective spanning tree
From MaRDI portal
Publication:1806877
DOI10.1016/S0377-2217(97)00391-3zbMath0937.90112OpenAlexW1985130949MaRDI QIDQ1806877
R. M. Ramos, Sergio Fernando Alonso Rodríguez, Joaquín Sicilia Rodríguez, Carlos González-Martín
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
spanning treemulti-criteria analysisminimum cost spanning treebiobjective optimal cost spanning tree
Related Items
Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach ⋮ A multi-agent transgenetic algorithm for the bi-objective spanning tree problem ⋮ Computing all efficient solutions of the biobjective minimum spanning tree problem ⋮ Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems ⋮ A new approach for the multiobjective minimum spanning tree ⋮ Finding all nondominated points of multi-objective integer programs ⋮ Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs ⋮ Branch-and-bound and objective branching with three or more objectives ⋮ Two‐phase strategies for the bi‐objective minimum spanning tree problem ⋮ Computation of ideal and Nadir values and implications for their use in MCDM methods. ⋮ A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives ⋮ COUNTING SPANNING TREES IN PRISM AND ANTI-PRISM GRAPHS ⋮ Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets ⋮ Two phase algorithms for the bi-objective assignment problem ⋮ Modeling and solving the bi-objective minimum diameter-cost spanning tree problem ⋮ An analysis on recombination in multi-objective evolutionary optimization ⋮ A GRASP algorithm for the multi-criteria minimum spanning tree problem ⋮ A survey of recent developments in multiobjective optimization ⋮ Multi-objective branch and bound ⋮ Ordered weighted average optimization in multiobjective spanning tree problem ⋮ Multicriteria path and tree problems: discussion on exact algorithms and applications ⋮ Exact algorithms for OWA-optimization in multiobjective spanning tree problems ⋮ Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors. ⋮ A preference-based approach to spanning trees and shortest paths problems ⋮ Dynamic programming for spanning tree problems: application to the multi-objective case ⋮ Finding multi-objective supported efficient spanning trees ⋮ Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations ⋮ Empirical study of exact algorithms for the multi-objective spanning tree ⋮ A Survey on Multiple Objective Minimum Spanning Tree Problems ⋮ Optimality conditions in preference-based spanning tree problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Efficient spanning trees
- On spanning tree problems with multiple objectives
- Structure of Efficient Sets for Convex Objectives
- Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
- Finding All Spanning Trees of Directed and Undirected Graphs
- An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs
- On the History of the Minimum Spanning Tree Problem
- Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs
- EFFICIENTLY SCANNING ALL SPANNING TREES OF AN UNDIRECTED GRAPH
