Abstract
This study focuses on the evacuation and recovery problem (ERP), which is modeled by graphs. The model provides support for the design of exact and fast and practically convenient algorithms. The ERP is viewed as a constrained longest path problem in a graph whose objective is to maximize the total profit under resource and information constraints. This study develops an exact algorithm and a new fast epsilon-approximation algorithm (FPTAS), which are proved to be efficient with respect to the time complexity. Finally, some open questions are proposed for future research.
Original language | English |
---|---|
Title of host publication | ICEMSI 2013 - 2013 International Conference on Engineering, Management Science and Innovation |
Publisher | Institute of Electrical and Electronics Engineers Inc. |
ISBN (Electronic) | 9781479935574 |
DOIs | |
State | Published - 30 Sep 2013 |
Externally published | Yes |
Event | 2013 International Conference on Engineering, Management Science and Innovation, ICEMSI 2013 - Taipa, Macao Duration: 28 Jun 2013 → 30 Jun 2013 |
Publication series
Name | ICEMSI 2013 - 2013 International Conference on Engineering, Management Science and Innovation |
---|
Conference
Conference | 2013 International Conference on Engineering, Management Science and Innovation, ICEMSI 2013 |
---|---|
Country/Territory | Macao |
City | Taipa |
Period | 28/06/13 → 30/06/13 |
Bibliographical note
Publisher Copyright:© 2013 IEEE.
Keywords
- evacuation and recovery problem
- exact and approximation algorithms
- scheduling