Algorithms for partitioning of large routing networks

DOI10.1057/JORS.2009.52zbMath1193.90048OpenAlexW2047946018MaRDI QIDQ3585725

No author found.

Publication date: 2 September 2010

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/jors.2009.52

zbMATH Keywords

graph partitioningload balancingdistributed computinglarge networks

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Simultaneous node and link districting in transportation networks: model, algorithms and railway application

This page was built for publication: Algorithms for partitioning of large routing networks