Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods

  title={Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods},
  author={Jos{\'e} Fern{\'a}ndez and Bogl{\'a}rka G.-T{\'o}th},
  journal={Comp. Opt. and Appl.},
Obtaining a complete description of the efficient set of multiobjective optimization problems can be of invaluable help to the decision-maker when the objectives conflict and a solution has to be chosen. In this paper we present an interval branch-and-bound algorithm which aims at obtaining a tight outer approximation of the whole efficient set of nonlinear biobjective problems. The method enhances the performance of a previous rudimentary algorithm thanks to the use of new accelerating devices… CONTINUE READING
8 Citations
50 References
Similar Papers


Publications citing this paper.
Showing 1-8 of 8 extracted citations


Publications referenced by this paper.
Showing 1-10 of 50 references

Reconciling franchisor and franchisee: a planar biobjective competitive location and design model

  • J. Fernández, B. Tóth, F. Plastria, B. Pelegrín
  • Seeger, A. (ed.) Recent Advances in Optimization…
  • 2006
Highly Influential
10 Excerpts

Planar location and design of a new facility with inner and outer competition: an interval lexicographical-like solution procedure

  • J. Fernández, B. Pelegrín, F. Plastria, B. Tóth
  • Netw. Spat. Econ. 7, 19–44
  • 2007
Highly Influential
4 Excerpts

Empirical convergence speed of inclusion functions for facility location problems

  • B. Tóth, J. Fernández, T. Csendes
  • J. Comput. Appl. Math. 199, 384–389
  • 2007
1 Excerpt

Interval methods for competitive location problems

  • B. Tóth
  • PhD thesis, Dpt. Computer Architecture and…
  • 2007
1 Excerpt

A multi-criteria modeling approach to jury selection

  • M. J. Schniederjans, E. Hollcroft
  • Socio-Econ. Plan. Sci. 39, 81–102
  • 2005
1 Excerpt

Approximation methods in multiobjective programming

  • S. Ruzika, M. M. Wiecek
  • J. Optim. Theory Appl. 126, 473–501
  • 2005
2 Excerpts

Similar Papers

Loading similar papers…