Name
Abstract | ||
|---|---|---|
•We add incompatibility constraints to the directed profitable rural postman problem.•We propose and compare two mathematical formulations for the problem.•We propose an effective matheuristic to solve the problem.•A new variant of the generalized independent set problem is introduced and a GRASP algorithm for its solution is proposed. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.ejor.2017.02.002 | European Journal of Operational Research |
Keywords | Field | DocType |
Routing,Rural postman problem,Incompatibility constraints,Generalized independent set problem | Mathematical optimization,IBM,Problem Formulations,Independent set,Total cost,Operations management,Mathematics | Journal |
Volume | Issue | ISSN |
261 | 2 | 0377-2217 |
Citations | PageRank | References |
0 | 0.34 | 21 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Marco Colombi | 1 | 12 | 1.89 |
| Ángel Corberán | 2 | 542 | 39.74 |
| Renata Mansini | 3 | 574 | 43.10 |
| Isaac Plana | 4 | 178 | 16.15 |
| José M. Sanchis | 5 | 205 | 16.51 |