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

DOI10.1080/00207160802524739zbMath1197.65067OpenAlexW2117535148WikidataQ57780939 ScholiaQ57780939MaRDI QIDQ5747723

Charalampos Papamanthou, Nikolaos Samaras, Angelo Sifaleras, Konstantinos Paparrizos

Publication date: 14 September 2010

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160802524739

zbMATH Keywords

exterior point algorithmnumerical examplescombinatorial optimizationsimplex algorithmassignment problemcomputational evaluationinitialization methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Interior-point methods (90C51) Combinatorial optimization (90C27)

Related Items (1)

Exterior point simplex-type algorithms for linear and network optimization problems

Uses Software

• TSPLIB
• OR-Library

Cites Work

• Computational experience with exterior point algorithms for the transportation problem
• An infeasible (exterior point) simplex algorithm for assignment problems
• Primal-dual algorithms for the assignment problem
• A sequential dual simplex algorithm for the linear assignment problem
• A relaxation column signature method for assignment problems
• Algorithms and codes for dense assignment problems: The state of the art
• Linear and semi-assignment problems: A core oriented approach
• Efficient dual simplex algorithms for the assignment problem
• A competitive (dual) simplex method for the assignment problem
• A new algorithm for the assignment problem
• TSPLIB—A Traveling Salesman Problem Library

This page was built for publication: On the initialization methods of an exterior point algorithm for the assignment problem