Two Algorithms for Generating Weighted Spanning Trees in Order

Cited in

(48)

Combinatorial optimization in system configuration design
On the \(K\) shortest path trees problem
Some basic exchange properties in combinatorial optimization and their application to constructing the k-best solutions
A lower bound on solutions of Chartrand's problem
Weighting factor extensions for finite multiple objective vector minimization problems
k-optimal solution sets for some polynomially solvable scheduling problems
Ranking arborescences in O(Km log n) time
Finding the \(k\) smallest spanning trees
The Min-Max Spanning Tree Problem and some extensions
On spanning tree problems with multiple objectives
On bicriterion minimal spanning trees: An approximation
Optimal vertex ordering of graphs
Parsimonious parameterization of correlation matrices using truncated vines and factor analysis
A new approach for the multiobjective minimum spanning tree
Multiobjective combinatorial optimization problems with a cost and several bottleneck objective functions: an algorithm with reoptimization
An O(K.n**4) algorithm for finding the K best cuts in a network
Adjacency on combinatorial polyhedra
A parallel algorithm for generating multiple ordering spanning trees in undirected weighted graphs
Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach
A note on \(K\) best network flows
Combinatorial algorithms for DNA sequence assembly
Enumerating \(K\) best paths in length order in DAGs
Hamiltonian decomposition and verifying vertex adjacency in 1-skeleton of the traveling salesperson polytope by variable neighborhood search
Truncation of vine copulas using fit indices
A decision-theoretic approach to robust optimization in multivalued graphs
Computing all efficient solutions of the biobjective minimum spanning tree problem
On the bicriterion - minimal cost/minimal label - spanning tree problem
Choquet-based optimisation in multiobjective shortest path and spanning tree problems
An algorithm for \(k^{\text{th}}\) minimum spanning tree
A Survey on Multiple Objective Minimum Spanning Tree Problems
Designing a minimal spanning tree network subject to a budget constraint
An efficient time and space K point-to-point shortest simple paths algorithm
The Kth TSP is pseudopolynomial when TSP is polynomial
Multicriteria path and tree problems: discussion on exact algorithms and applications
Finding the k smallest spanning trees
Faster enumeration of all spanning trees of a directed graph
\(k\)-best solutions of MSO problems on tree-decomposable graphs
Backtracking Algorithms for Constructing the Hamiltonian Decomposition of a 4-regular Multigraph
Enumerating the \(k\) best plane spanning trees
Two‐phase strategies for the bi‐objective minimum spanning tree problem
Obtaining approximately optimal and diverse solutions via dispersion
An approximation algorithm for K-best enumeration of minimal connected edge dominating sets with cardinality constraints
Efficient constant-factor approximate enumeration of minimal subsets for monotone properties with weight constraints
Grouping strategies on two-phase methods for bi-objective combinatorial optimization
Minimal-cost route planning via Fibonacci-heap-typed data structure
A branch and bound algorithm for the robust spanning tree problem with interval data
Fair cost-sharing methods for the minimum spanning tree game
Minimum spanning trees in networks with varying edge weights

This page was built for publication: Two Algorithms for Generating Weighted Spanning Trees in Order

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