Constrained spanning trees and the traveling salesman problem
From MaRDI portal
Publication:1823163
DOI10.1016/0377-2217(89)90356-1zbMath0679.90085MaRDI QIDQ1823163
Publication date: 1989
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(89)90356-1
90C35: Programming involving graphs or networks
05C05: Trees
65K05: Numerical mathematical programming methods
Related Items
A matroid algorithm and its application to the efficient solution of two optimization problems on graphs, A note on relatives to the Held and Karp 1-tree problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An \(0(| E|\log\log| V|)\) algorithm for finding minimum spanning trees
- A multiply constrained matroid optimization problem
- A Dynamic Programming Approach to Sequencing Problems
- Cliques in random graphs
- Solution of a Large-Scale Traveling-Salesman Problem
- A Method for Solving Traveling-Salesman Problems
- The Traveling-Salesman Problem and Minimum Spanning Trees
- The traveling-salesman problem and minimum spanning trees: Part II