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

DOI10.1016/S0166-218X(99)00125-0zbMATH Open0987.90084OpenAlexW2002500041MaRDI QIDQ1962035FDOQ1962035

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

Recommendations

• scientific article
• 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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Linear Tree Partitioning Algorithm
• 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
• An Analysis of Some Graph Theoretical Cluster Techniques
• Restrictions of graph partition problems. I
• An efficiently solvable graph partition problem to which many problems are reducible
• A shifting algorithm for constrained min-max partition on trees
• Optimum Network Partitioning
• A spanning tree heuristic for regional clustering
• The simulated trading heuristic for solving vehicle routing problems
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (7)

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

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)