✦ LIBER ✦

An Algorithm for Approximating Convex Pareto Surfaces Based on Dual Techniques

✍ Scribed by Bokrantz, Rasmus; Forsgren, Anders

Book ID: 115546270
Publisher: Operations Research Society of America
Year: 2013
Tongue: English
Weight: 430 KB
Volume: 25
Category: Article
ISSN: 0899-1499
DOI: 10.1287/ijoc.1120.0508

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

CONLIN: An efficient dual optimizer base

CONLIN: An efficient dual optimizer based on convex approximation concepts

✍ C. Fleury 📂 Article 📅 1989 🏛 Springer-Verlag 🌐 English ⚖ 753 KB

An algorithm for discrete approximation

An algorithm for discrete approximation by quasi-convex functions on Rm

✍ V.A. Ubhaya 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 368 KB

An Efficient Multiobjective Optimizer Ba

An Efficient Multiobjective Optimizer Based on Genetic Algorithm and Approximation Techniques for Electromagnetic Design

✍ Ho, S.L.; Yang, S.Y.; Ni, G.Z.; Wong, K.F. 📂 Article 📅 2007 🏛 IEEE 🌐 English ⚖ 139 KB

An algorithm for clustering based on non

An algorithm for clustering based on non-smooth optimization techniques

✍ A. M. Bagirov; A. M. Rubinov; N. V. Soukhoroukova; J. Yearwood 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 93 KB

An algorithm for polygonal approximation

An algorithm for polygonal approximation based on iterative point elimination

✍ Arie Pikaz; Its'hak Dinstein 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 626 KB

An algorithm for silhouette of curved su

An algorithm for silhouette of curved surfaces based on graphical relations

✍ Luisa Bonfiglioli 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 504 KB

The proposed algorithm d/splays the projected surface F as a quadrilateral grid of straight segments, g; any one of these can be part of the silhouette if, and only if, the two patches connected along g lie on the same side of it. The same segment g is drawn, if it is not hidden by remote patches. T