A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization
% SALE
A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization
% SALE
% SALE
Description
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.
Product details
- Type:
- Book
- Binding:
- Paperback
- Edition:
- 1
- Languages:
-
Original:
English
- Number of Pages:
-
80
- Publisher:
-
Springer VS
- Publication Date:
-
2020-01-22
- ISBN / EAN:
-
9783658291488
- Weight:
-
131 g
- Dimensions:
-
15/21/1 cm
- GPSR Manufacturer Reference:
-
[email protected]
Die gelieferte Auflage kann ggf. abweichen.
Currently sold out
Back in stock email
Add to Wishlist
