On the initialization methods of an exterior point algorithm for the assignment problem

International Journal of Computer Mathematics

Volumn 87, Issue 8, 2010, Pages 1831-1846

  Papamanthou, C ^a   Paparrizos, K ^b   Samaras, N ^b   Sifaleras, A ^b  

^a Brown Univerity   (United States)

^b UNIVERSITY OF MACEDONIA   (Greece)

Author keywords

assignment problem; combinatorial optimization; computational evaluation; exterior point algorithm; initialization methods

Indexed keywords

ASSIGNMENT PROBLEMS; BENCH-MARK PROBLEMS; COMPUTATIONAL EVALUATION; COMPUTATIONAL STUDIES; EXPERIMENTAL EVALUATION; INITIALIZATION METHODS; POINT ALGORITHMS; THEORETICAL INVESTIGATIONS;

ALGORITHMS;

COMBINATORIAL OPTIMIZATION;

EID: 77954640589     PISSN: 00207160     EISSN: 10290265     Source Type: Journal    
DOI: 10.1080/00207160802524739     Document Type: Article

References (23)

1. H. Achatz, P. Kleinschmidt, and K. Paparrizos, A dual forest algorithm for the assignment problem, in DIMACS Series in Discrete Mathematics and Theoretical Computer Science (joint publication of the Association for Computing Machinery and the American Mathematical Society), Appl. Geom. Discrete Math. 4(1991), pp. 1-12.
2. A. Achatz, K. Paparrizos, N. Samaras, and K. Tsiplidis, A forest exterior point algorithm for assignment problems, in Combinatorial and Global Optimization, M. P. Pardalos, A. Midgalas, and R. Buckard, eds., Word Scientific Publishing Co., Singapore, 2002, pp. 1-10.
3. M. Akgül, A sequential dual simplex algorithm for the linear assignment problem, Oper. Res. Lett. 7(7), pp. 155-158.
4. M. Akgül and O. Ekin, A dual feasible forest algorithm for the assignment problem, RAIRO Oper. Res. 25(25), pp. 403-411.
5. D. M. Amico and P. Toth, Algorithms and codes for dense assignment problems: the state of the art, Discrete Appl. Math. 100(2000), pp. 17-48.
6. L. M. Balinski, A competitive (dual) simplex method for the assignment problem, Math. Program. 34(34), pp. 125-141.
7. J. E. Beasley, OR-Library: distributing test problems by electronic mail, J. Oper. Res. Soc. 41(1990), pp. 1069-1072.
8. J. E. Beasley, Linear programming on cray supercomputers. J. Oper. Res. Soc. 41(1990), pp. 133-139.
9. R. D. Bertsekas, A new algorithm for the assignment problem, Math. Program. 21(1981), pp. 152-171.
10. G. Carpaneto and P. Toth, Primal-dual algorithms for the assignment problem, Discrete Appl. Math. 18(18), pp. 137-153.
11. U. Derigs, The shortest augmenting path method for solving assignment problems - motivation and computational experience, Ann. Oper. Res. 4(1985), pp. 57-102.
12. D. Goldfarb, Efficient dual simplex methods for the assignment problem, Math. Program. 37(1985), pp. 187-203.
13. J. Kennington and Z. Wang, An empirical analysis of the dense assignment problem: sequential and parallel implementations, ORSA J. Comput. 3(4) (1991), pp. 299-306.
14. W. H. Kuhn, The Hungarian method for the assignment and transportation problems. Naval Res. Logis. Q. 2(1955), pp. 83-97.
15. S. Martello and P. Toth Linear assignment problems, in Surveys in Combinatorial Optimization, S. Martello, G. Laporte, M. Minoux, and C. Ribeiro, eds., North-Holland, Amsterdam, Ann. Discrete Math. 31(31), pp. 259-282.
16. Ch. Papamanthou, K. Paparrizos, and N. Samaras, Computational experience with exterior point algorithms for the transportation problem, Appl. Math. Comput. 158(2004), pp. 459-475.
17. Ch. Papamanthou, K. Paparrizos, and N. Samaras, A parametric visualization software for the assignment problem, Yugoslav J. Oper. Res. 15(1) (2005), pp. 1-12.
18. K. Paparrizos, A non-dual signature method for the assignment problem and a generalization of the dual simplex method for the transportation problem, RAIRO Oper. Res. 22(1988), pp. 269-289.
19. K. Paparrizos, A relaxation column signature method for assignment problems, Eur. J. Oper. Res. 50(1991), pp. 211-219.
20. K. Paparrizos, An infeasible (exterior point) simplex algorithm for assignment problems, Math. Program. 51(1991), pp. 45-54.
21. K. Paparrizos, A non improving simplex algorithm for transportation problems, RAIRO Oper. Res. 30(30), pp. 1-15.
22. G. Reinelt, TSPLib - a traveling salesman problem library, ORSA J. Comput. 3(1991), pp. 376-384.
23. A. Volgenant, Linear and semi-assignment problems: a core oriented approach, Comput. Oper. Res. 23(23), pp. 917-932.