Title: A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization (BestMasters)
Publisher: Springer Spektrum
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 specialise in General Interest Books from South Asian countries.

Visit Seller's Storefront

Seller's business information

BOOKS AND PERIODICALS AGENCY LTD
90 Barnet Gate Lane, Barnet, EN5 2AX, United Kingdom

Sale & Shipping Terms

Terms of Sale

Returns accepted if you are not satisfied with the Service or Book.

Shipping Terms

Best packaging and fast delivery

Shipping rates from United Kingdom to U.S.A.

Shipping rates from United Kingdom to U.S.A.
Order quantity	14 to 45 business days	5 to 10 business days
First item	US$ 8.70	US$ 13.18

Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.