Name
Abstract | ||
|---|---|---|
We introduce an integer linear programming formulation for the Traveling Repairman Problem with unit time windows, which produces approximate solutions within a factor of 4 to the optimal solution. We analyze empirically the required time to solve this formulation using a state-of-the-art MIP solver. Finally, we discuss an extension to our approach to windows of arbitrary length. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/ICEEE.2015.7357940 | 2015 12th International Conference on Electrical Engineering, Computing Science and Automatic Control (CCE) |
Keywords | Field | DocType |
ILP approach,traveling repairman problem with unit time windows,integer linear programming formulation,MIP solver | Linear-fractional programming,Approximation algorithm,Mathematical optimization,Computer science,Branch and price,Integer linear programming formulation,Integer programming,Linear programming,Solver,Linear programming relaxation | Conference |
Citations | PageRank | References |
0 | 0.34 | 1 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yani Miguel-Pilar | 1 | 0 | 0.34 |
| Guillermo Morales-luna | 2 | 99 | 28.89 |
| Feliu Davino Sagols Troncoso | 3 | 5 | 2.15 |
| Francisco Javier Zaragoza Martínez | 4 | 5 | 3.91 |