Pages that link to "Item:Q115238"
From MaRDI portal
The following pages link to On the shortest spanning subtree of a graph and the traveling salesman problem (Q115238):
Displaying 11 items.
- A note on two problems in connexion with graphs (Q78129) (← links)
- A unified heuristic for a large class of vehicle routing problems with backhauls (Q819067) (← links)
- Robust inference of trees (Q819944) (← links)
- Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem (Q953318) (← links)
- Maintaining dynamic minimum spanning trees: an experimental study (Q968158) (← links)
- On the value of a random minimum spanning tree problem (Q1066149) (← links)
- Solving the optimum communication spanning tree problem (Q1991267) (← links)
- Discrete Bayesian Network Classifiers (Q5178092) (← links)
- The traveling-salesman problem and minimum spanning trees: Part II (Q5641007) (← links)
- Matroids and the greedy algorithm (Q5668601) (← links)
- Polynomial-time algorithms for multimarginal optimal transport problems with structure (Q6038667) (← links)
