A note on relatives to the Held and Karp 1-tree problem

Authors:
Andreas Westerlund;Maud GöThe-Lundgren;TorbjöRn Larsson
Affiliations:
Department of Mathematics, Linköping University, SE-581 83 Linköping, Sweden;Department of Mathematics, Linköping University, SE-581 83 Linköping, Sweden;Department of Mathematics, Linköping University, SE-581 83 Linköping, Sweden
Venue:
Operations Research Letters
Year:
2006

Citing 5
Cited 2

An optimal solution method for large-scale multiple traveling salesmen problems

Operations Research
Probabilistic analysis of the held and Karp lower bound for the euclidean traveling salesman problem

Mathematics of Operations Research
On the nucleolus of the basic vehicle routing game

Mathematical Programming: Series A and B
On the Held-Karp relaxation for the asymmetric and symmetric traveling salesman problems

Mathematical Programming: Series A and B
A stabilized column generation scheme for the traveling salesman subtour problem

Discrete Applied Mathematics - Special issue: International symposium on combinatorial optimization CO'02

A stabilized column generation scheme for the traveling salesman subtour problem

Discrete Applied Mathematics - Special issue: International symposium on combinatorial optimization CO'02
The k-path tree matroid and its applications to survivable network design

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study a class of graph problems which includes as special cases the Held and Karp 1-tree problem, and the minimum spanning tree problem with one degree constraint studied by Glover and Klingman. For another special case, we note a mistake in a paper by Ramesh, Yoon and Karwan.