Robustness in the Pareto-solutions for the multi-criteria minisum location problem
暂无分享,去创建一个
[1] John A. White. A Quadratic Facility Location Problem , 1971 .
[2] D. Hearn,et al. Geometrical Solutions for Some Minimax Location Problems , 1972 .
[3] 丸山 徹. Convex Analysisの二,三の進展について , 1977 .
[4] Thomas Ottmann,et al. Algorithms for Reporting and Counting Geometric Intersections , 1979, IEEE Transactions on Computers.
[5] Nimrod Megiddo,et al. Linear-time algorithms for linear programming in R3 and related problems , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[6] N. Megiddo. Linear-time algorithms for linear programming in R3 and related problems , 1982, FOCS 1982.
[7] D. White. Optimality and efficiency , 1982 .
[8] A. Warburton. Quasiconcave vector maximization: Connectedness of the sets of Pareto-optimal and weak Pareto-optimal alternatives , 1983 .
[9] Atsuyuki Okabe,et al. Spatial Tessellations: Concepts and Applications of Voronoi Diagrams , 1992, Wiley Series in Probability and Mathematical Statistics.
[10] J. Hiriart-Urruty,et al. Convex analysis and minimization algorithms , 1993 .
[11] Justo Puerto,et al. Efficiency in Euclidean constrained location problems , 1993, Oper. Res. Lett..
[12] H. Hamacher,et al. Multicriteria planar location problems , 1996 .
[13] J. B. G. Frenk,et al. General models in min-max planar location: Checking optimality conditions , 1996 .
[14] 大澤 義明. A geometrical solution for quadratic bicriteria location models , 1997 .
[15] A Gerodimos,et al. Robust Discrete Optimization and its Applications , 1996, J. Oper. Res. Soc..
[16] Kaisa Miettinen,et al. Nonlinear multiobjective optimization , 1998, International series in operations research and management science.
[17] Matthias Ehrgott,et al. On the number of criteria needed to decide Pareto optimality , 2002, Math. Methods Oper. Res..