Succinct approximate convex pareto curves
暂无分享,去创建一个
[1] Günther Ruhe,et al. Complexity results for multicriterial and parametric network flows using a pathological graph of Zadeh , 1988, ZOR Methods Model. Oper. Res..
[2] Mihalis Yannakakis,et al. Multiobjective query optimization , 2001, PODS '01.
[3] Mihalis Yannakakis,et al. Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems , 2007, APPROX-RANDOM.
[4] Xavier Gandibleux,et al. An Annotated Bibliography of Multiobjective Combinatorial Optimization , 2000 .
[5] Matthias Ehrgott,et al. Multiple criteria decision analysis: state of the art surveys , 2005 .
[6] Jirí Matousek,et al. How to net a lot with little: small ε-nets for disks and halfspaces , 1990, SCG '90.
[7] Kenneth L. Clarkson,et al. Algorithms for Polytope Covering and Approximation , 1993, WADS.
[8] Balaji Venkatachalam,et al. Sensitivity Analysis in Combinatorial Optimization , 2007, Handbook of Approximation Algorithms and Metaheuristics.
[9] Alok Aggarwal,et al. Finding minimal convex nested polygons , 1985, SCG '85.
[10] Michael T. Goodrich,et al. Almost optimal set covers in finite VC-dimension , 1995, Discret. Comput. Geom..
[11] Kousha Etessami,et al. Multi-Objective Model Checking of Markov Decision Processes , 2007, Log. Methods Comput. Sci..
[12] Thomas A. Henzinger,et al. Markov Decision Processes with Multiple Objectives , 2006, STACS.
[13] Piet Van Mieghem,et al. Trade-Off Curves for QoS Routing , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.
[14] Ramaswamy Chandrasekaran,et al. Minimal ratio spanning trees , 1977, Networks.
[15] Nimrod Megiddo,et al. Applying parallel computation algorithms in the design of serial algorithms , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).
[16] Joseph S. B. Mitchell,et al. Separation and approximation of polyhedral objects , 1992, SODA '92.
[17] David L Craft,et al. Approximating convex pareto surfaces in multiobjective radiotherapy planning. , 2006, Medical physics.
[18] Patricia J. Carstensen. The complexity of some problems in parametric linear and combinatorial programming , 1983 .
[19] Nimrod Megiddo. Combinatorial Optimization with Rational Objective Functions , 1979, Math. Oper. Res..
[20] E. Polak,et al. On Multicriteria Optimization , 1976 .
[21] Sergei Vassilvitskii,et al. Efficiently computing succinct trade-off curves , 2005, Theor. Comput. Sci..
[22] Christos H. Papadimitriou,et al. Approximately dominating representatives , 2005, Theor. Comput. Sci..
[23] Mihalis Yannakakis,et al. On the approximability of trade-offs and optimal access of Web sources , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[24] S. Ruzika,et al. Approximation Methods in Multiobjective Programming , 2005 .
[25] Nimrod Megiddo,et al. Combinatorial optimization with rational objective functions , 1978, Math. Oper. Res..
[26] M. Zeleny. Linear Multiobjective Programming , 1974 .
[27] Arthur Warburton,et al. Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems , 1987, Oper. Res..
[28] S French,et al. Multicriteria Analysis , 1998, J. Oper. Res. Soc..
[29] Pierre Hansen,et al. Bicriterion Path Problems , 1980 .
[30] Kaisa Miettinen,et al. Nonlinear multiobjective optimization , 1998, International series in operations research and management science.