A Polynomial Algorithm for the Degree-Constrained Minimum K-Tree Problem

DOI10.1287/opre.42.4.775zbMath0815.90131OpenAlexW2128348056MaRDI QIDQ4319765

Marshall L. Fisher

Publication date: 1994

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.42.4.775

zbMATH Keywords

vehicle routingLagrangian relaxationsminimum \(k\)-tree algorithms

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06)

Related Items (9)

A memory-based iterated local search algorithm for the multi-depot open vehicle routing problem ⋮ Approximation algorithms for constructing spanning \(K\)-trees using stock pieces of bounded length ⋮ A stabilized column generation scheme for the traveling salesman subtour problem ⋮ A tabu search algorithm for the open vehicle routing problem ⋮ A note on relatives to the Held and Karp 1-tree problem ⋮ A new tabu search algorithm for the vehicle routing problem with backhauls ⋮ A branch and bound algorithm for the exact solution of the problem of EMU circulation scheduling in railway network ⋮ Stronger \(K\)-tree relaxations for the vehicle routing problem ⋮ The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations

This page was built for publication: A Polynomial Algorithm for the Degree-Constrained Minimum K-Tree Problem