Tracked shipping to South Africa with premium packaging for just R199 

Ship to
South Africa
0
  • argentina
  • chile
  • colombia
  • españa
  • méxico
  • perú
  • estados unidos
  • internacional

Select your country

Americas

Europe

Rest of the world

portada A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization
Type
Physical Book
Collection
BestMasters
Year
2020
Pages
70
Format
Paperback
Dimensions
21x14.9x0.7 cm
ISBN13
9783658291488

A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization

Stefan Rocktaschel (Author) · Springer Spektrum · Paperback

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

Cheaper New Book Imported to South Africa
Delivery: 23 Oct - 05 Nov Shipping: 17 to 21 business days.
R 965
Faster New Book Imported to South Africa
Delivery: 20 Oct - 28 Oct Shipping: 14 to 15 business days.
R 1,144
R 965

Synopsis "A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization"

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.

Customers reviews

Frequently Asked Questions about the Book

All books in our catalog are Original.
The binding of this edition is Paperback.

Questions and Answers about the Book

Do you have a question about the book? Login to be able to add your own question.

Opinions about Bookdelivery

More customer reviews