Spanning tree manipulation and the travelling salesman problem

DOI10.1093/comjnl/10.4.374zbMath0159.21502OpenAlexW2051378252MaRDI QIDQ5542561

A. K. Obrucha

Publication date: 1968

Published in: The Computer Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/comjnl/10.4.374

zbMATH Keywords

numerical analysis

Related Items (2)

ILP formulation of the degree-constrained minimum spanning hierarchy problem ⋮ Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem

This page was built for publication: Spanning tree manipulation and the travelling salesman problem