A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization - Stefan Rocktäschel
-20% with code BOOKS
Shipping in 15-21 days
30-day return policy
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.
You May Also Like
TOP
Six Not-so-easy Pieces: Einstein's Relativity, Symmetry, and Space-Time
Richard P. Feynman, Robert B. Leighton, Matthew Sands
-20% with code BOOKS
In stock at our supplier
TOP
Six Easy Pieces: Essentials of Physics Explained by Its Most Brilliant Teacher
Richard P. Feynman, Robert B. Leighton, Matthew Sands
-20% with code BOOKS
In stock at our supplier
TOP
Behave: The Biology of Humans at Our Best and Worst
-20% with code BOOKS
In stock at our supplier
TOP
The Age of Alchemy: How Early Innovators Shaped Modern Chemistry
-20% with code BOOKS
In stock at our supplier
TOP
The Secrets of our DNA: How Genetics has Changed the World
-20% with code BOOKS
In stock at our supplier
TOP
Why We Sleep: Unlocking the Power of Sleep and Dreams
-20% with code BOOKS
In stock
TOP
Astrophysics for People in a Hurry: Essays on the Universe and Our Place Within It
-20% with code BOOKS
In stock at our supplier
TOP
The Rise and Fall of the Dinosaurs: A New History of a Lost World
-20% with code BOOKS
In stock at our supplier
TOP
The Rise and Reign of the Mammals: A New History, from the Shadow of the Dinosaurs to Us
-20% with code BOOKS
In stock at our supplier
TOP
Determined: The Science of Life Without Free Will
-20% with code BOOKS
In stock at our supplier
TOP
Learn Faster, Perform Better: A Musician's Guide to the Neuroscience of Practicing
-20% with code BOOKS
In stock at our supplier
TOP
Beyond Inheritance: Our Ever-Mutating Cells and a New Understanding of Health
-20% with code BOOKS
In stock at our supplier
TOP
How to Solve it: A New Aspect of Mathematical Method
-20% with code BOOKS
In stock at our supplier
TOP
Thing Explainer: Complicated Stuff in Simple Words
-20% with code BOOKS
In stock at our supplier
TOP
Introduction to Quantum Mechanics
Darrell F. Schroeter, David J. Griffiths
-20% with code BOOKS
In stock at our supplier
TOP
Factfulness: Ten Reasons We're Wrong About the World--and Why Things Are Better Than You Think
Ola Rosling, Anna Rosling Rönnlund, Hans Rosling
-20% with code BOOKS
In stock at our supplier
TOP
Universe: The Definitive Visual Guide
-20% with code BOOKS
In stock at our supplier
TOP
How Far the Light Reaches: A Life in Ten Sea Creatures
-20% with code BOOKS
In stock at our supplier
TOP
The Light Eaters: How the Unseen World of Plant Intelligence Offers a New Understanding of Life on Earth
-20% with code BOOKS
In stock at our supplier
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.
More Information
| Author | Stefan Rocktäschel |
|---|---|
| Publisher | Springer Fachmedien Wiesbaden |
| Series | BestMasters |
| Release year | 2020 |
| Cover type | Softcover |
| EAN | 9783658291488 |