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

References

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