Tree partitioning under constraints. -- Clustering for vehicle routing problems
type: Item
instance of: scholarly article
title: Tree partitioning under constraints. -- Clustering for vehicle routing problems
zbMATH Open document ID: 0987.90084
DOI: 10.1016/S0166-218X(99)00125-0
author: Anja Hamacher
author: Winfried. Hochstättler
author: Christoph Moll
published in: Discrete Applied Mathematics
publication date: 2000-01-30T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 1395004
zbMATH Keywords: vehicle routing
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: dynamic programming
MaRDI profile type: Publication
cites work: A shifting algorithm for constrained min-max partition on trees
cites work: Q3056948
cites work: An Analysis of Some Graph Theoretical Cluster Techniques
cites work: The simulated trading heuristic for solving vehicle routing problems
cites work: The shifting algorithm technique for the partitioning of trees
cites work: Restrictions of graph partition problems. I
cites work: A linear time algorithm for graph partition problems
cites work: Q4198056
cites work: An efficiently solvable graph partition problem to which many problems are reducible
cites work: Q4039765
cites work: Q3838116
cites work: Optimum Network Partitioning
cites work: A Linear Tree Partitioning Algorithm
cites work: Q4855483
cites work: A spanning tree heuristic for regional clustering
cites work: On a graph partition problem with application to VLSI layout
full work available at URL: s0166-218x(99)00125-0
OpenAlex ID: W2002500041
description: scientific article; zbMATH DE number 1395004