Multi-period Assignment Problem
The Multi-Period Assignment Problem is a dynamic optimization model that extends the classical assignment problem by allocating resources to tasks over multiple time periods, accounting for temporal dependencies, evolving constraints, and sequential decision-making under resource continuity requirements.
34
Publications
1.5K
Citations
88
Authors
60
Institutions
Publications per year
2017–2026
10
Parents
34
1–5 of 34
88
2
h-index
2
h-index
2
h-index
2
h-index
1
h-index
1–5 of 88
60
Ohio University
Athens, United States
2 h-index
4 publications
144 citations
University of Missouri
Columbia, United States
2 h-index
2 publications
129 citations
Clemson University
Clemson, United States
2 h-index
2 publications
129 citations

Centre National de la Recherche Scientifique
Paris, France
2 h-index
10 publications
515 citations

University of Twente
Enschede, The Netherlands
1 h-index
4 publications
92 citations
École Polytechnique
Palaiseau, France
1 h-index
2 publications
34 citations
IMT Atlantique
Nantes, France
1 h-index
5 publications
90 citations

University of Georgia
Athens, United States
1 h-index
1 publications
41 citations
1–8 of 60
5 publications · 165 citations
5
h-index
4 publications · 164 citations
4
h-index
3 publications · 89 citations
3
h-index
2 publications · 34 citations
2
h-index
2 publications · 59 citations
2
h-index
1–5