| Article ID: | iaor1994472 |
| Country: | United Kingdom |
| Volume: | 20 |
| Issue: | 6 |
| Start Page Number: | 665 |
| End Page Number: | 678 |
| Publication Date: | Aug 1993 |
| Journal: | Computers and Operations Research |
| Authors: | Furth V.H., Rietveld B. |
| Keywords: | graphs |
This report discusses a solution method to convert spoke coverage diagrams into contour coverage diagrams. It is relatively easy to make a spoke to contour conversion by hand; however, from an analytical point of view the conversion seems complex. By concentrating on ‘why it is so easy to draw contours by hand’, the problem could be decomposed into a less complex form. Two standard algorithms have been applied to solve the problem. The scaled auction algorithm and an algorithm based on a branch-and-bound method. The application of the algorithms resulted in a major improvement of the presentation and quality of combined coverage diagrams.