| Article ID: | iaor19961749 |
| Country: | Germany |
| Volume: | 41 |
| Issue: | 3 |
| Start Page Number: | 347 |
| End Page Number: | 358 |
| Publication Date: | May 1995 |
| Journal: | Mathematical Methods of Operations Research (Heidelberg) |
| Authors: | Zhang J., Ma Z., Yang C. |
In this paper the authors formulate an inverse shortest path problem as a special linear programming problem. A column generation scheme is developed that is able to keep most columns of the LP model implicit and to generate necessary columns by shortest path algorithms. This method can get an optimal solution in finitely many steps. Some numerical results are reported to show that the algorithm has a good performance.