Approximation algorithms for constructing spanning \(K\)-trees using stock pieces of bounded length
From MaRDI portal
Publication:1686555
DOI10.1007/s11590-016-1078-5zbMath1386.90162OpenAlexW2519759404MaRDI QIDQ1686555
Junran Lichen, Jianping Li, Ko-Wei Lih
Publication date: 15 December 2017
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-016-1078-5
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Approximations for constructing tree-form structures using specific material with fixed length
- Stronger \(K\)-tree relaxations for the vehicle routing problem
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Worst-case analysis of a new heuristic for the travelling salesman problem
- A stabilized column generation scheme for the traveling salesman subtour problem
- A note on relatives to the Held and Karp 1-tree problem
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- An Analysis of Several Heuristics for the Traveling Salesman Problem
- The Held—Karp algorithm and degree-constrained minimum 1-trees
- An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
- A Polynomial Algorithm for the Degree-Constrained Minimum K-Tree Problem
- The Traveling-Salesman Problem and Minimum Spanning Trees
- The traveling-salesman problem and minimum spanning trees: Part II
This page was built for publication: Approximation algorithms for constructing spanning \(K\)-trees using stock pieces of bounded length
