✦ LIBER ✦

Optimal product design using conjoint analysis: Computational complexity and algorithms

✍ Scribed by Rajeev Kohli; Ramesh Krishnamurti

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 733 KB
Volume: 40
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(89)90329-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Design and Analysis of Optimization Algo

Design and Analysis of Optimization Algorithms Using Computational Statistics

✍ T. Bartz–Beielstein; K. E. Parsopoulos; M. N. Vrahatis 📂 Article 📅 2004 🏛 John Wiley and Sons ⚖ 606 KB

Analysis, design and optimization of str

Analysis, design and optimization of structures using force method and genetic algorithm

✍ A. Kaveh; H. Rahami 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 149 KB

Algorithmic and computational aspects of

Algorithmic and computational aspects of the use of optimization methods in engineering design

✍ Garth P. McCormick 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 643 KB

Current results in fast algorithm comput

Current results in fast algorithm computational complexity analysis, computer architecture design, and VLSI hardware advances with applications to digital signal processing

✍ Jim Schroeder 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 481 KB

Computer Algorithms — Introduction to de

Computer Algorithms — Introduction to design and analysis (second edition) : S. Baase, Addison Wesley, Reading, Mass., 1988. 415 pp., US $40.95. ISBN 0-201-06035-3

✍ W.F. Ames 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 75 KB

Algorithmic and computational aspects of

Algorithmic and computational aspects of the use of optimization methods in engineering design: McCormick, G.P. George Washington University, School of Eng. and Applied Science, USA (19 pp, 19 ref)

📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 118 KB

Fhe authors introduce refinements into the randomized pattern search method The randomized method of Lawrence and Stelghtz augments the ability of the method to adapt to direction An algorithm is derived that makes the method more adaptive in step size and incorporates penaltv terms to accommodate c