✦ LIBER ✦

On the terminal control problem

✍ Scribed by A. M. Steinberg; K. Shmueli

Publisher: Springer
Year: 1973
Tongue: English
Weight: 314 KB
Volume: 11
Category: Article
ISSN: 0022-3239
DOI: 10.1007/bf00935201

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the equivalency of piecewise-constant

On the equivalency of piecewise-constant control with a known number of switchings and arbitrary amplitude bounded control in a terminal problem for a linear nonstationary system

✍ E. A. Shushlyapin 📂 Article 📅 1993 🏛 Springer US 🌐 English ⚖ 297 KB

A note on termination in optimal control

A note on termination in optimal control problems

✍ G. Leitmann; H. Stalford 📂 Article 📅 1971 🏛 Springer 🌐 English ⚖ 123 KB

On the terminal Steiner tree problem

✍ Guohui Lin; Guoliang Xue 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 69 KB

We investigate a practical variant of the well-known graph Steiner tree problem. In this variant, every target vertex is required to be a leaf vertex in the solution Steiner tree. We present hardness results for this variant as well as a polynomial time approximation algorithm with performance ratio

Synthesis of control in a linear termina

Synthesis of control in a linear terminal problem

✍ B. A. Skorokhod 📂 Article 📅 1993 🏛 Springer US 🌐 English ⚖ 256 KB

A note on the terminal Steiner tree prob

A note on the terminal Steiner tree problem

✍ Bernhard Fuchs 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 53 KB

In 2002, Lin and Xue [Inform. Process. Lett. 84 (2002) 103-107] introduced a variant of the graph Steiner tree problem, in which each terminal vertex is required to be a leaf in the solution Steiner tree. They presented a ρ + 2 approximation algorithm, where ρ is the approximation ratio of the bes

On global maximum of a convex terminal f

On global maximum of a convex terminal functional in optimal control problems

✍ A. S. Strekalovsky 📂 Article 📅 1995 🏛 Springer US 🌐 English ⚖ 640 KB