Vetenskap & teknik
Pocket
A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization
Stefan Rocktschel
759:-
Uppskattad leveranstid 7-12 arbetsdagar
Fri frakt för medlemmar vid köp för minst 249:-
Stefan Rocktschel 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.
- Format: Pocket/Paperback
- ISBN: 9783658291488
- Språk: Engelska
- Antal sidor: 70
- Utgivningsdatum: 2020-01-22
- Förlag: Springer Spektrum