On the shortest spanning subtree of a graph and the traveling salesman problem

Cited In (only showing first 100 items - show all)

A template-based adaptive large neighborhood search for the consistent vehicle routing problem
Using tours to visually investigate properties of new projection pursuit indexes with application to problems in physics
Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem
A combinatorial approach to assess the separability of clusters
Fast Constrained Image Segmentation Using Optimal Spanning Trees
Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints
VNS and second order heuristics for the min-degree constrained minimum spanning tree problem
The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
The traveling-salesman problem and minimum spanning trees: Part II
Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem
Double scaling in tensor models with a quartic interaction
A Lagrangean approach to the degree-constrained minimum spanning tree problem
Generalized minimum spanning tree games
Bayesian network classifiers for identifying the slope of the customer lifecycle of long-life customers.
Planning models for freight transportation
\(N\)-dimensional Boolean hypercubes and the Goldbach conjecture
Linear estimating equations for exponential families with application to Gaussian linear concentration models
On the revealed preference analysis of stable aggregate matchings
Reduced clique graphs of chordal graphs
Multiperiod location-routing with decoupled time scales
Generalized constructive tree weights
New variants of pairwise classification
Maximising the worth of nascent networks
On estimation of the diagonal elements of a sparse precision matrix
Constructive tensor field theory
Optimal topological simplification of discrete functions on surfaces
Low-degree minimum spanning trees
Three-way distances
Axiomatization of the Shapley value on minimum cost spanning tree games
How to resum Feynman graphs
A non-cooperative game theory approach to cost sharing in networks
Heuristics for the mixed swapping problem
A unified heuristic for a large class of vehicle routing problems with backhauls
Matroids and the greedy algorithm
Fast approximation for computing the fractional arboricity and extraction of communities of a graph
Looking for edge-equitable spanning trees
GA topology optimization using random keys for tree encoding of structures
Parallel computation and conflicts in memory access
Search for an immobile entity on a network
On the spanning trees of weighted graphs
Realizing fair outcomes in minimum cost spanning tree problems through non-cooperative mechanisms
The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm
Maximizing information exchange between complex networks
Minimax regret spanning arborescences under uncertain costs
An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
Lower and upper bounds for the \(m\)-peripatetic vehicle routing problem
An optimal PRAM algorithm for a spanning tree on trapezoid graphs.
Proving phylogenetic trees minimal with l-clustering and set partitioning
Factors affecting the final solution of the bike-sharing rebalancing problem under heuristic algorithms
Using Lagrangian dual information to generate degree constrained spanning trees
A tabu search heuristic for the generalized minimum spanning tree problem
Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem
The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm
Solving the 2-rooted mini-max spanning forest problem by branch-and-bound
Operations research games: A survey. (With comments and rejoinder)
A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation
How to find Steiner minimal trees in Euclidean \(d\)-space
A survey of recent developments in multiobjective optimization
Min-max optimization of several classical discrete optimization problems
A heuristic algorithm for the mini-max spanning forest problem
A branch-and-bound algorithm for the mini-max spanning forest problem
Discrete Bayesian network classifiers: a survey
On spanning tree problems with multiple objectives
A note on two problems in connexion with graphs
On the relationship between the biconnectivity augmentation and traveling salesman problems
On the correspondence between tree representations of chordal and dually chordal graphs
A primal-dual approximation algorithm for the Steiner forest problem
An axiomatic approach in minimum cost spanning tree problems with groups
Minimum cost spanning tree games and population monotonic allocation schemes.
Obligation rules for minimum cost spanning tree situations and their monotonicity properties
A generalization of obligation rules for minimum cost spanning tree problems
\(K\)-tree/\(K\)-subgraph: A program package for minimal weighted \(K\)-cardinlity trees and subgraphs
mstclustering
Sparse nonparametric graphical models
``Optimistic weighted Shapley rules in minimum cost spanning tree problems
A fair rule in minimum cost spanning tree problems
A new rule for source connection problems
Ripser: efficient computation of Vietoris-Rips persistence barcodes
Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
A family of block-wise one-factor distributions for modeling high-dimensional binary data
Local search with perturbations for the prize-collecting Steiner tree problem in graphs
CciMST: a clustering algorithm based on minimum spanning tree and cluster centers
An edge-swap heuristic for generating spanning trees with minimum number of branch vertices
A linear-size zero-one programming model for the minimum spanning tree problem in planar graphs
A Benders decomposition approach for the robust spanning tree problem with interval data
Algorithms to solve the knapsack constrained maximum spanning tree problem
A graph approach to generate all possible regression submodels
Assessing probabilistic forecasts of multivariate quantities, with an application to ensemble predictions of surface winds
Robust estimation of location and scatter by pruning the minimum spanning tree
Congestion network problems and related games
First vs. best improvement: an empirical study
The \(P\)-value for cost sharing in minimum
Algorithms to test open set condition for self-similar set related to P.V. numbers
Fuzzy random bottleneck spanning tree problems using possibility and necessity measures
Savings based ant colony optimization for the capacitated minimum spanning tree problem
Fast reoptimization for the minimum spanning tree problem
Characterizations of the cycle-complete and folk solutions for minimum cost spanning tree problems
The vertex degrees of minimum spanning trees
Combinatorial optimisation and hierarchical classifications
Quasi-Linear-Time Algorithms by Generalisation of Union-Find in CHR

This page was built for publication: On the shortest spanning subtree of a graph and the traveling salesman problem

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