Title: A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization (BestMasters)
Publisher: Springer
Publication Date: 2020
Language: English
ISBN 10: 3658291486
ISBN 13: 9783658291488
Binding: Soft cover
Condition: New

About this title

Synopsis

Stefan Rockt�schel introduces a branch-and-bound algorithm that determines a cover of the efficient set of multiobjective mixed-integer convex optimization problems. He examines particular steps of this algorithm in detail and enhances the basic algorithm with additional modifications that ensure a more precise cover of the efficient set. Finally, he gives numerical results on some test instances.

About the Author

Stefan Rockt�schel works as scientific assistant at the Institute for Mathematics of Technische Universit�t Ilmenau, Germany.

"About this title" may belong to another edition of this title.

Store Description

We carry a wide selection of books from South Asia, United States, UK.

Visit Seller's Storefront

Seller's business information

Readingos GmbH
Kaiserstra�e 47, Frankfurt am Main, 60329, Germany

Sale & Shipping Terms

Terms of Sale

Shipping Terms

To ensure faster delivery, books may be shipped from any of the following locations Germany, the United Kingdom (UK), the United States (US), based on the buyer's address and product availability.