Multiobjective Dynamic Programming
Multiobjective Dynamic Programming is a dynamic programming approach that systematically decomposes multiobjective optimization problems into stages, distinguishing itself by simultaneously optimizing multiple conflicting objectives through recursive evaluation of Pareto-optimal solutions across decision states.
124
Publications
5.3K
Citations
345
Authors
178
Institutions
Publications per year
2017–2026
35
124
A unified approach to route planning for shared mobility
Yongxin Tong, Yuxiang Zeng, Zimu Zhou et al. · Proceedings of the VLDB Endowment · 2018 · 183 citations · Full text
Novel prediction and memory strategies for dynamic multiobjective optimization
Peng Zhou, Jinhua Zheng, Juan Zou et al. · Soft Computing · 2014 · 142 citations
1–5 of 124
345
5
h-index
3
h-index
3
h-index
3
h-index
2
h-index
1–5 of 345
178

Menoufia University
Shibīn al Kawm, Egypt
5 h-index
5 publications
111 citations
Tsinghua University
Beijing, China
4 h-index
17 publications
441 citations
University of Maryland, College Park
College Park, United States
3 h-index
8 publications
1.1K citations

Tanta University
Tanta, Egypt
3 h-index
3 publications
64 citations
University of Virginia
Charlottesville, United States
3 h-index
5 publications
249 citations
Indian Institute of Technology Kharagpur
Kharagpur, India
3 h-index
7 publications
363 citations
Dalian University of Technology
Dalian, China
2 h-index
3 publications
89 citations
Northwestern University
Evanston, United States
2 h-index
3 publications
112 citations
1–8 of 178
5 publications · 127 citations
5
h-index
4 publications · 120 citations
4
h-index
4 publications · 59 citations
4
h-index
3 publications · 130 citations
3
h-index
3 publications · 155 citations
3
h-index
1–5