Pages that link to "Item:Q4319765"
From MaRDI portal
The following pages link to A Polynomial Algorithm for the Degree-Constrained Minimum K-Tree Problem (Q4319765):
Displaying 13 items.
- An algorithm for \(k^{\text{th}}\) minimum spanning tree (Q327676) (← links)
- A tabu search algorithm for the open vehicle routing problem (Q703907) (← links)
- The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations (Q814246) (← links)
- Approximation algorithms for constructing spanning \(K\)-trees using stock pieces of bounded length (Q1686555) (← links)
- A branch and bound algorithm for the exact solution of the problem of EMU circulation scheduling in railway network (Q1793684) (← links)
- Stronger \(K\)-tree relaxations for the vehicle routing problem (Q1827647) (← links)
- A polynomial algorithm for deciding the validity of an electrical distribution tree (Q2122795) (← links)
- A memory-based iterated local search algorithm for the multi-depot open vehicle routing problem (Q2178077) (← links)
- A stabilized column generation scheme for the traveling salesman subtour problem (Q2433808) (← links)
- A note on relatives to the Held and Karp 1-tree problem (Q2494821) (← links)
- A new tabu search algorithm for the vehicle routing problem with backhauls (Q2496076) (← links)
- Polynomial Time Algorithms for the MIN CUT Problem on Degree Restricted Trees (Q3740255) (← links)
- A polynomial algorithm for thep-centdian problem on a tree (Q4540080) (← links)
