An approach to the problems of routing optimization in the regions of intricate shape

DOI10.1016/0020-0190(81)90148-4zbMath0472.68030OpenAlexW1966069487MaRDI QIDQ1157911

S. V. Smelyakov, Yu. G. Stoyan

Publication date: 1981

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(81)90148-4

zbMATH Keywords

combinatorial problemspath spacesdesign automationconnecting networkshomotopical completeness and minimalityoptimal paths in non-simply connected two-dimensional regionspath equivalence classes

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical optimization and variational techniques (65K10) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (1)

A position-situation approach to regularization of mappings of geometrical information

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: An approach to the problems of routing optimization in the regions of intricate shape