A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex OptimizationA basic Branch-and-Bound algorithm for (MOMICP)
A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization: A basic...
Rocktäschel, Stefan
2020-01-22 00:00:00
[In this chapter, we introduce a basic algorithm for computing a ’good’ cover of the efficient set of (MOMICP). The algorithm illustrates the basic procedure that we use. The idea of this Branch-and-Bound algorithm is to iteratively split the initial box B into smaller subboxes and derive lower and upper bounds for respective subproblems.]
http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.pnghttp://www.deepdyve.com/lp/springer-journals/a-branch-and-bound-algorithm-for-multiobjective-mixed-integer-convex-yEcZZtLp3q
A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex OptimizationA basic Branch-and-Bound algorithm for (MOMICP)
[In this chapter, we introduce a basic algorithm for computing a ’good’ cover of the efficient set of (MOMICP). The algorithm illustrates the basic procedure that we use. The idea of this Branch-and-Bound algorithm is to iteratively split the initial box B into smaller subboxes and derive lower and upper bounds for respective subproblems.]
To get new article updates from a journal on your personalized homepage, please log in first, or sign up for a DeepDyve account if you don’t already have one.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.