An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem
Year of publication: |
2012
|
---|---|
Authors: | Benson, Harold |
Published in: |
Journal of Global Optimization. - Springer. - Vol. 52.2012, 3, p. 553-574
|
Publisher: |
Springer |
Subject: | Multiple objective nonlinear programming | Global optimization | Weakly efficient set | Branch and bound |
Saved in:
Saved in favorites
Similar items by subject
-
A practicable branch and bound algorithm for sum of linear ratios problem
Jiao, Hong-Wei, (2015)
-
Maximal covering location problems on networks with regional demand
Blanquero, Rafael, (2016)
-
SOCP relaxation bounds for the optimal subset selection problem applied to robust linear regression
Flores, Salvador, (2015)
- More ...
Similar items by person