Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods
| Year of publication: |
2009
|
|---|---|
| Authors: | Fernández, José ; Tóth, Boglárka |
| Published in: |
Computational Optimization and Applications. - Springer. - Vol. 42.2009, 3, p. 393-419
|
| Publisher: |
Springer |
| Subject: | Nonlinear biobjective optimization | Efficient set | Outer approximation | Interval analysis | Branch-and-bound method | Discarding tests | Continuous location |
-
Fernández, José, (2007)
-
Algorithms for the minimum spanning tree problem with resource allocation
Kataoka, Seiji, (2016)
-
An exact solution method for unconstrained quadratic 0–1 programming: a geometric approach
Li, D., (2012)
- More ...
-
Fernández, José, (2007)
-
A practical algorithm for decomposing polygonal domains into convex polygons by diagonals
Fernández, José, (2008)
-
A practical algorithm for decomposing polygonal domains into convex polygons by diagonals
Fernández, José, (2008)
- More ...