Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods.
Saved in:
| Title: | Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods. |
|---|---|
| Authors: | Fernández, José1, josefdez@um.es, Tóth, Boglárka2, bog@math.bme.hu |
| Source: | Computational Optimization & Applications; Apr2009, Vol. 42 Issue 3, p393-419, 27p, 5 Diagrams, 2 Charts |
| Database: | Applied Science & Technology Source |
| ISSN: | 09266003 |
|---|---|
| DOI: | 10.1007/s10589-007-9135-8 |
