Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex OptimizationEnhancing Algorithm 1

A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization: Enhancing... [In this chapter, we introduce modifications that enhance the basic Branch-and-Bound algorithm for (MOMICP), we introduced in Chapter 3. We follow different goals with these modifications. We would like to reduce the amount of computational time, the algorithm requires, as well as provide a ’better’ cover of the efficient set of (MOMICP).] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex OptimizationEnhancing Algorithm 1

Download PDF
8 pages

Loading next page...
 
/lp/springer-journals/a-branch-and-bound-algorithm-for-multiobjective-mixed-integer-convex-wFcOgC5NNM
Publisher
Springer Fachmedien Wiesbaden
Copyright
© Springer Fachmedien Wiesbaden GmbH, part of Springer Nature 2020
ISBN
978-3-658-29148-8
Pages
41 –49
DOI
10.1007/978-3-658-29149-5_4
Publisher site
See Chapter on Publisher Site

Abstract

[In this chapter, we introduce modifications that enhance the basic Branch-and-Bound algorithm for (MOMICP), we introduced in Chapter 3. We follow different goals with these modifications. We would like to reduce the amount of computational time, the algorithm requires, as well as provide a ’better’ cover of the efficient set of (MOMICP).]

Published: Jan 22, 2020

There are no references for this article.