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 OptimizationIntroduction

A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization: Introduction [Mixed-integer optimization problems (MIP) appear in a variety of applications like in economics or engineering. One example is the uncapacitated facility location problem studied by Günlük, Lee, Weismantel [9], where integer variables are used to model the decision for a facility, whether it should be built or not. Additionally, there are continuous variables which state the percentage of the respective customers’ demands which is met by any given facility.] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex OptimizationIntroduction

Download PDF
2 pages

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

Abstract

[Mixed-integer optimization problems (MIP) appear in a variety of applications like in economics or engineering. One example is the uncapacitated facility location problem studied by Günlük, Lee, Weismantel [9], where integer variables are used to model the decision for a facility, whether it should be built or not. Additionally, there are continuous variables which state the percentage of the respective customers’ demands which is met by any given facility.]

Published: Jan 22, 2020

There are no references for this article.