✦ LIBER ✦

On criteria and generation of optimal paths

✍ Scribed by Donald T. Tang; Kiyoshi Maruyama

Publisher: Elsevier Science
Year: 1981
Tongue: English
Weight: 144 KB
Volume: 1
Category: Article
ISSN: 0166-5316
DOI: 10.1016/0166-5316(81)90050-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the smoothness of optimal paths

✍ Blot, Joël ;Crettez, Bertrand 📂 Article 📅 2004 🏛 Springer ⚖ 314 KB

Optimality criteria and duality in multi

Optimality criteria and duality in multiple-objective optimization involving generalized invexity

✍ R. N. Kaul; S. K. Suneja; M. K. Srivastava 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 632 KB

On optimal orientations of Cartesian pro

On optimal orientations of Cartesian products of even cycles and paths

✍ Koh, K. M.; Tay, E. G. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 122 KB

For a graph G , let D ( G ) be the family of strong orientations of G , and define d ៝ ( G ) Å min{d(D)ÉD √ D(G)}, where d(D) is the diameter of the digraph D. In this paper, we evaluate the values of d ៝ (C 2n 1

Iso-parametric CNC tool path optimizatio

Iso-parametric CNC tool path optimization based on adaptive grid generation

✍ Wei He; Ming Lei; Hongzan Bin 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 660 KB

Optimal probe path generation and new gu

Optimal probe path generation and new guide point selection methods

✍ J.W. Lee; M.K. Kim; K. Kim 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 554 KB

Optimal orientations of products of path

Optimal orientations of products of paths and cycles

✍ K.M. Koh; E.G. Tay 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 656 KB

For a graph G, let 9(G) be the family of strong orientations of G, d(G) = min{d(D) / D t 9' (G)} and p(G) = d(G) -d(G), where d(G) and d(D) are the diameters of G and D respectively. In this paper we show that p(G) = 0 if G is a Cartesian product of (I ) paths, and (2) paths and cycles, which satis