✦ LIBER ✦

An approximating algorithm for an optimum aim-points problem

✍ Scribed by Sidney I. Firstman

Publisher: John Wiley and Sons
Year: 1960
Tongue: English
Weight: 827 KB
Volume: 7
Category: Article
ISSN: 0894-069X
DOI: 10.1002/nav.3800070205

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An iterative algorithm for optimum contr

An iterative algorithm for optimum control problems

✍ Menahem Sidar 📂 Article 📅 1968 🏛 Elsevier Science 🌐 English ⚖ 948 KB

An algorithm for approximating condition

An algorithm for approximating conditional probabilities

✍ Bryan S. Todd 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 715 KB

An approximative algorithm for the fixed

An approximative algorithm for the fixed-charges transportation problem

✍ Harold W. Kuhn; William J. Baumol 📂 Article 📅 1962 🏛 John Wiley and Sons 🌐 English ⚖ 840 KB

A 2-Approximation Algorithm for Finding

A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph

✍ Vincenzo Auletta; Yefim Dinitz; Zeev Nutov; Domenico Parente 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 71 KB

The problem of finding a minimum weight k-vertex connected spanning sub-Ž . graph in a graph G s V, E is considered. For k G 2, this problem is known to be NP-hard. Combining properties of inclusion-minimal k-vertex connected graphs Ž and of k-out-connected graphs i.e., graphs which contain a vertex

An algorithm for approximation of functi

An algorithm for approximation of functions

✍ R Chattopadhyay 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 203 KB

An interior-point algorithm for elastopl

An interior-point algorithm for elastoplasticity

✍ K. Krabbenhoft; A. V. Lyamin; S. W. Sloan; P. Wriggers 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 645 KB