Doesn't suit? No problem! You can return within 30 days
You won't go wrong with a gift voucher. The gift recipient can choose anything from our offer.
30-day return policy
This book presents a new approach to global non-convex constrained optimization. Problem dimensionality is reduced via space-filling curves. To economize the search, constraint is accounted separately (penalties are not employed). The multicriteria case is also considered. All techniques are generalized for (non-redundant) execution on multiprocessor systems. §Audience: Researchers and students working in optimization, applied mathematics, and computer science.