Abstract
The datastructure “quad tree” is used to identify efficent solutions of discrete vector optimization problems. This datastructure is very well suited to support several types of searches among the set of efficient solutions. Computational experiences with the construction of the set of efficient solutions of some randomly generated test problems are reported.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bowman, J.: On the Relationship of the Tchebycheff Norm and the efficient Frontier of Multiple-Criteria Objectives, in: Thiriez, H., Zionts, S.: Multiple Criteria Decision Making, Berlin-HeidelbergNew York, 1976, pp. 76–86.
Daellenbach, H.G., De Kluyver, C.A.: Note on Multiple Objective Dynamic Programming, in: J.o.t. Oper.Res.Soc., Vol. 31(1980),pp.591–594.
Finkel, R.A., Bentley, J.L.: Quad trees, a datastructure for retrieval on composite keys, in: Acta Informatica 4 (1974), pp.1–9.
Habenicht, W.: Efficiency in general vector maximum problems, in: Ricerca Operativa VIII (1978), pp. 89–101.
Habenicht, W.: Efficient routes in vector-valued graphs, in: Mühlbacher, J.R.(ed.): Proc. of the 7th Conf. on Graphtheoretic Concepts in Comp. Science, München-Wien 1982, pp. 349–355.
Habenicht, W.: Der Einsatz von Quadbäumen zur Identifizierung and Auswahl effizienter Vektoren, Working paper des BWI, Universität Stuttgart, Feb. 1982.
Henig, M.: The Shortest Path Problem with Two Objective Functions. Paper of Fac. of Managern., Tel Aviv Univ., Tel Aviv 1982.
Joksch, H.C.: The Shortest Route Problem with Constraints, in: J.of Math. Anal. and Appl., Vol. 14 (1966), pp. 191–197.
Korhonen, P., Wallenius, J., Zionts, S.: Some Theory and a Method for Solving the Discrete Multiple Criteria Problem, Working paper 498, Helsinki School of Economics, Nov. 1981.
Overmaars, M.H., Van Leeuwen, J.: Dynamic Multi-Dimensional Data-structures Based on Quad-and K-D Trees. Techn. Rep. RUU-CS-80–2, Utrecht 1980.
Shapiro, J.F.: Multiple Criteria Public Investment Decision Making by Mixed Integer Programming, in: Thiriez, H., Zionts, S.(eds.): Multiple Criteria Decision Making, Berlin-Heidelberg-New York 1976, pp. 170–182.
Steuer, R.E., Harris, F.W.: Intra-Set Point Generation and Filtering in Decision and Criteria Space, in: Comp.and OPs.Res.,7(1980),pp.41–53.
Vujosevic, M., Petrovic, R., Senborn,A.: Multicriteria determination of the best paths.-Application of pareto-optimality principle. Paper of the Mihaido Pupin Institute, Beograd 1982.
Zionts, S.: A multiple criteria method for choosing among discrete alternatives, in: Europ. J. of Op. Res., 7(1981), pp. 143–147.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1983 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Habenicht, W. (1983). Quad Trees, a Datastructure for Discrete Vector Optimization Problems. In: Hansen, P. (eds) Essays and Surveys on Multiple Criteria Decision Making. Lecture Notes in Economics and Mathematical Systems, vol 209. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-46473-7_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-46473-7_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11991-3
Online ISBN: 978-3-642-46473-7
eBook Packages: Springer Book Archive