scientific article; zbMATH DE number 4051669

MaRDI QIDQ3788043zbMATH OpenFDO

Authors V. M. Bondarov, V. I. Rublinetskij, V. L. Sigalov

Publication date 1988

zbMATH Keywords

initial obstaclesrouting problemshortest path

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Deterministic network models in operations research (90B10)

Recommendations

• On a bottleneck routing problem
• Routing through a generalized switchbox
• Routing in polygons without rectilinearly visible corners
• Finding shortest paths in the plane in the presence of barriers to travel (for any \(l_ p\)-norm)
• scientific article; zbMATH DE number 4039320

Cited in

(16)

• Generating and counting valid patterns in routes between two points
• An optimal design of piping route in a CAD system for power plant
• A cyclic method for channel routing
• scientific article; zbMATH DE number 1696838 (Why is no real title available?)
• On constructing the shortest circuits on a set of line segments
• scientific article; zbMATH DE number 3896699 (Why is no real title available?)
• Graphical-structure-based models for routing problems
• A solvable routing problem
• scientific article; zbMATH DE number 39101 (Why is no real title available?)
• Time complexity of a path formulated optimal routing algorithm (second printing)
• Construction Line Algorithms for the Connection Location-Allocation Problem
• An algorithm for finding the number of shortest routes on square lattices
• UNLEASHING THE VERMIN (VECTORED ROUTE-LENGTH MINIMIZATION)
• Graph Drawing
• Evolutionary-fragmentary model of the routing problem
• Routing with critical paths

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3788043)