Output-sensitive algorithms for enumerating the extreme nondominated points of multiobjective combinatorial optimization problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 9294, Issue , 2015, Pages 288-299

  Bökler, Fritz ^a   Mutzel, Petra ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; LINEAR PROGRAMMING; OPTIMIZATION; POLYNOMIAL APPROXIMATION; POLYNOMIALS;

COMPUTATIONAL EXPERIMENT; COMPUTATIONAL STUDIES; ENUMERATION PROBLEMS; LEXICOGRAPHIC OPTIMIZATION; MULTIOBJECTIVE COMBINATORIAL OPTIMIZATION; MULTIOBJECTIVE SPANNING TREE PROBLEMS; NON-DOMINATED POINTS; OUTPUT-SENSITIVE ALGORITHM;

MULTIOBJECTIVE OPTIMIZATION;

EID: 84945584151     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-662-48350-3_25     Document Type: Conference Paper

References (18)

1. Agarwal, P.K., Eppstein, D., Guibas, L.J., Henzinger, M.R.: Parametric and kinetic minimum spanning trees. In: IEEE FoCS, pp. 596–605 (1998)
2. Aissi, H., Mahjoub, A.R., McCormick, S.T., Queyranne, M.: A strongly polynomial time algorithm for multicriteria global minimum cuts. In: Lee, J., Vygen, J. (eds.) IPCO 2014. LNCS, vol. 8494, pp. 25–36. Springer, Heidelberg (2014)
3. Aneja, Y.P., Nair, K.P.K.: Bicriteria transportation problem. Management Science 25(1), 73–78 (1979)
4. Avis, D., Fukuda, K.: A pivoting algorithm for convex hulls and vertex enumeration of arrangements of polyhedra. Discrete and Computational Geometry 8(1), 295–313 (1992)
5. Brunsch, T., Röglin, H.: Improved smoothed analysis of multiobjective optimization. In: ACM SToC, pp. 407–426 (2012)
6. Chazelle, B.: An optimal convex hull algorithm in any fixed dimension. Discrete Computational Geometry 10, 377–409 (1993)
7. Ehrgott, M., Gandibleux, X.: A survey and annotated bibliography of multiobjective combinatorial optimization. OR Spektrum 22, 425–460 (2000)
8. Ehrgott, M., Löhne, A., Shao, L.: A dual variant of Benson’s “outer approximation algorithm” for multiple objective linear programming. Journal of Global Optimization 52, 757–778 (2012)
9. Fukuda, K., Prodon, A.: Double description method revisited. In: Deza, M., Manoussakis, I., Euler, R. (eds.) CCS 1995. LNCS, vol. 1120, pp. 91–111. Springer, Heidelberg (1996)
10. Ganley, J.L., Golin, M.J., Salowe, J.S.: The multi-weighted spanning tree problem. In: Li, M., Du, D.-Z. (eds.) COCOON 1995. LNCS, vol. 959, pp. 141–150. Springer, Heidelberg (1995)
11. Hamel, A.H., Löhne, A., Rudloff, B.: Benson type algorithms for linear vector optimization and applications. arXiv:1302.2415 [math.OC] (July 2013)
12. Heyde, F., Löhne, A.: Geometric duality in multiple objective linear programming. SIAM Journal of Optimization 19(2), 836–845 (2008)
13. Johnson, D.S., Yannakakis, M., Papadimitriou, C.H.: On generating all maximal independent sets. Information Processing Letters 27, 119–123 (1988)
14. Okamoto, Y., Uno, T.: A polynomial-time-delay and polynomial-space algorithm for enumeration problems in multi-criteria optimization. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol. 4835, pp. 609–620. Springer, Heidelberg (2007)
15. Özpeynirci, Ö., Köksalan, M.: An exact algorithm for finding extreme supported nondominated points of multiobjective mixed integer programs. Management Science 56(12), 2302–2315 (2010)
16. Papadimitriou, C.H., Yannakakis, M.: On the approximability of trade-offs and optimal access of web sources. In: IEEE FoCS, pp. 86–92 (2000)
17. Przybylski, A., Gandibleux, X., Ehrgott, M.: A recursive algorithm for finding all nondominated extreme points in the outcome set of a multiobjective integer programme. INFORMS Journal on Computing 22(3), 371–386 (2010)
18. Seidel, R.: The upper bound theorem for polytopes: an easy proof of its asymptotic version. Computational Geometry 5, 115–116 (1995)