Verified Methods for Computing Pareto Sets: General Algorithmic Analysis
By: Boglárka G.-Tóth and Vladik Kreinovich
Open Access
|Sep 2009References
- Aberth, O. (2007)., Academic Press, San Diego, CA.
- Beeson, M. (1978). Some relations between classical and constructive mathematics,(2): 228-246.
- Beeson, M. (1985)., Springer, Berlin/Heidelberg/New York, NY.
- Bishop, E. and Bridges, D. S. (1985)., Springer-Verlag, Berlin/Heidelberg/New York, NY.
- Fernández, J. and Tóth, B. (2006). Obtaining the efficient set of biobjective competitive facility location and design problems,, pp. T-28.
- Fernández, J. and Tóth, B. (2007). Obtaining an outer approximation of the efficient set of nonlinear biobjective problems,(2): 315-331.
- Fernández, J. and Tóth, B. (2009). Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods,(3):393-419.
- Fernández, J., Tóth, B., Plastria, F. and Pelegrín, B. (2006). Reconciling franchisor and franchisee: A planar multiobjective competitive location and design model,A. Seeger (Ed.), Lecture Notes in Economics and Mathematical Systems, Vol., Berlin/Heidelberg/New York, NY, pp. 375-398.
- Figueira, J., Greco, S. and Ehrgott, M. (Eds.) (2004)., Kluwer, Dordrecht.
- Kreinovich, V. (1975). Uniqueness implies algorithmic computability,, pp. 19-21, (in Russian).
- Kreinovich, V. (1979)., Ph.D. dissertation, Institute of Mathematics, Soviet Academy of Sciences, Siberian Branch, Novosibirsk, (in Russian).
- Kreinovich, V., Lakeyev, A., Rohn, J. and Kahl, P. (1998)., Kluwer, Dordrecht.
- Kushner, B. A. (1985)., American Mathematical Society, Providence, RI.
- Nachbar, J. H. and Zame, W. R. (1996). Non-computable strategies and discounted repeated games,(1): 103-122.
- Nickel, S. and Puerto, J. (2005)., Springer-Verlag, Berlin.
- Ruzika, S. and Wiecek, M. M. (2005). Approximation methods in multiopbjective programming.(3): 473-501.
- Tóth, B. and Fernández, J. (2006). Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods,.
Language: English
Page range: 369 - 380
Published on: Sep 24, 2009
Published by: University of Zielona Góra
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year
Related subjects:
© 2009 Boglárka G.-Tóth, Vladik Kreinovich, published by University of Zielona Góra
This work is licensed under the Creative Commons License.