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

DOI10.1016/S0166-218X(99)00125-0zbMath0987.90084OpenAlexW2002500041MaRDI QIDQ1962035

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

dynamic programmingcombinatorial optimizationvehicle routing

Mathematics Subject Classification ID

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

Related Items (4)

A subexponential algorithm for the coloured tree partition problem ⋮ Attack and defense in the layered cyber-security model and their \((1 \pm \varepsilon)\)-approximation schemes ⋮ A hybrid fuzzy-optimization approach to customer grouping-based logistics distribution operations ⋮ Partitioning of trees for minimizing height and cardinality

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Restrictions of graph partition problems. I
• A shifting algorithm for constrained min-max partition on trees
• A linear time algorithm for graph partition problems
• On a graph partition problem with application to VLSI layout
• The shifting algorithm technique for the partitioning of trees
• The simulated trading heuristic for solving vehicle routing problems
• An efficiently solvable graph partition problem to which many problems are reducible
• A Linear Tree Partitioning Algorithm
• A spanning tree heuristic for regional clustering
• An Analysis of Some Graph Theoretical Cluster Techniques
• Optimum Network Partitioning

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