A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization - BestMasters - Stefan Rocktaschel - Books - Springer Fachmedien Wiesbaden - 9783658291488 - January 22, 2020
In case cover and title do not match, the title is correct

Stefan Rocktaschel
A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization - BestMasters 2020 edition

Price
R 915
excl. VAT

Ordered from remote warehouse

Expected to be ready for shipping Jun 12 - 18

Our customers say:

14-day return policy in accordance with European consumer protection law
Top ranking on Trustpilot
Add to your iMusic wish list

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.

70 pages, 15 Illustrations, black and white; VIII, 70 p. 15 illus.

Media Books     Paperback Book   (Book with soft cover and glued back)
Released January 22, 2020
ISBN13 9783658291488
Publishers Springer Fachmedien Wiesbaden
Pages 70
Dimensions 210 × 149 × 7 mm   ·   138 g
Language German  

Mere med samme udgiver

See all of Stefan Rocktaschel ( e.g. Paperback Book )