Tree partitioning under constraints. -- Clustering for vehicle routing problems

DOI10.1016/S0166-218X(99)00125-0MaRDI QIDQ1962035zbMATH OpenOpenAlexFDO

Authors Anja Hamacher, Winfried. Hochstättler, Christoph Moll

Publication date 30 January 2000

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0166-218x(99)00125-0

zbMATH Keywords

combinatorial optimizationdynamic programmingvehicle routing

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Transportation, logistics and supply chain management (90B06)

Recommendations

• scientific article; zbMATH DE number 1184494
• Two exact algorithms for the vehicle routing problem on trees
• Capacitated Vehicle Routing on Trees
• An exact approach for the multi-constraint graph partitioning problem
• A shifting algorithm for constrained min-max partition on trees

Cites work

• scientific article; zbMATH DE number 1184494 (Why is no real title available?)
• scientific article; zbMATH DE number 192876 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 815426 (Why is no real title available?)
• A Linear Tree Partitioning Algorithm
• A linear time algorithm for graph partition problems
• A shifting algorithm for constrained min-max partition on trees
• A spanning tree heuristic for regional clustering
• An Analysis of Some Graph Theoretical Cluster Techniques
• An efficiently solvable graph partition problem to which many problems are reducible
• Network flows. Theory, algorithms, and applications.
• On a graph partition problem with application to VLSI layout
• Optimum Network Partitioning
• Restrictions of graph partition problems. I
• The shifting algorithm technique for the partitioning of trees
• The simulated trading heuristic for solving vehicle routing problems

Cited in

(7)

• Size-Constrained Tree Partitioning: A Story on Approximation Algorithm Design for the Multicast k-Tree Routing Problem
• Attack and defense in the layered cyber-security model and their \((1 \pm \varepsilon)\)-approximation schemes
• A subexponential algorithm for the coloured tree partition problem
• A hybrid fuzzy-optimization approach to customer grouping-based logistics distribution operations
• Partitioning of trees for minimizing height and cardinality
• Size-constrained tree partitioning: approximating the multicast \(k\)-tree routing problem
• scientific article; zbMATH DE number 1184494 (Why is no real title available?)

This page was built for publication: Tree partitioning under constraints. -- Clustering for vehicle routing problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1962035)