The problem of the optimal biobjective spanning tree
From MaRDI portal
(Redirected from Publication:1806877)
Recommendations
Cites work
- Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs
- An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs
- Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
- Efficient spanning trees
- EFFICIENTLY SCANNING ALL SPANNING TREES OF AN UNDIRECTED GRAPH
- Finding All Spanning Trees of Directed and Undirected Graphs
- scientific article; zbMATH DE number 3936534 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- Network flows. Theory, algorithms, and applications.
- On spanning tree problems with multiple objectives
- On the History of the Minimum Spanning Tree Problem
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Structure of Efficient Sets for Convex Objectives
Cited in
(58)- Optimality conditions in preference-based spanning tree problems
- The hybrid spanning tree problem
- On spanning tree problems with multiple objectives
- On bicriterion minimal spanning trees: An approximation
- Computation of ideal and Nadir values and implications for their use in MCDM methods.
- Combining linear and nonlinear objectives in spanning tree problems
- A new approach for the multiobjective minimum spanning tree
- A biobjective Dijkstra algorithm
- Multi-objective branch and bound
- Ordered weighted average optimization in multiobjective spanning tree problem
- Exact algorithms for OWA-optimization in multiobjective spanning tree problems
- Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach
- Heuristic and exact algorithms for the spanning tree detection problem
- Dynamic programming for spanning tree problems: application to the multi-objective case
- Finding multi-objective supported efficient spanning trees
- A multi-agent transgenetic algorithm for the bi-objective spanning tree problem
- Empirical study of exact algorithms for the multi-objective spanning tree
- Computing all efficient solutions of the biobjective minimum spanning tree problem
- 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
- Branch-and-bound and objective branching with three or more objectives
- scientific article; zbMATH DE number 3891405 (Why is no real title available?)
- Looking for edge-equitable spanning trees
- On possibly optimal tradeoffs in multicriteria spanning tree problems
- scientific article; zbMATH DE number 4156450 (Why is no real title available?)
- scientific article; zbMATH DE number 4156454 (Why is no real title available?)
- A Survey on Multiple Objective Minimum Spanning Tree Problems
- scientific article; zbMATH DE number 3918119 (Why is no real title available?)
- scientific article; zbMATH DE number 3980505 (Why is no real title available?)
- Finding all nondominated points of multi-objective integer programs
- A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
- scientific article; zbMATH DE number 1160278 (Why is no real title available?)
- scientific article; zbMATH DE number 2014426 (Why is no real title available?)
- Spanning Trees and Optimization Problems
- scientific article; zbMATH DE number 4119973 (Why is no real title available?)
- Modeling and solving the bi-objective minimum diameter-cost spanning tree problem
- An analysis on recombination in multi-objective evolutionary optimization
- Multicriteria path and tree problems: discussion on exact algorithms and applications
- Counting spanning trees in prism and anti-prism graphs
- Bi-objective branch-and-cut algorithms based on LP relaxation and bound sets
- On bilevel minimum and bottleneck spanning tree problems
- An exact method for solving the bi-objective minimum diameter-cost spanning tree problem
- Balancing profits and costs on trees
- Computational methods for logistics problems related to optimal trees
- Two‐phase strategies for the bi‐objective minimum spanning tree problem
- Biobjective optimization problems on matroids with binary costs
- On solving bi-objective constrained minimum spanning tree problems
- On the problem of finding all minimum spanning trees
- On the enumeration of non-dominated spanning trees with imprecise weights
- Complexity of the multiobjective minimum weight minimum stretch spanner problem
- New dynamic programming algorithm for the multiobjective minimum spanning tree problem
- 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
- Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations
- Efficient spanning trees
- Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems
- A GRASP algorithm for the multi-criteria minimum spanning tree problem
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)
