scientific article
From MaRDI portal
Publication:3974955
zbMath0743.90077MaRDI QIDQ3974955
Peter Kleinschmidt, Konstantinos Paparrizos, Hans Achatz
Publication date: 26 June 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Resolution of the problem of degeneracy in a primal and dual simplex algorithm, Improving bipartite graph edit distance approximation using various search strategies, Worst case examples of an exterior point algorithm for the assignment problem, Exterior point simplex-type algorithms for linear and network optimization problems, Using combinatorial optimization in model-based trimmed clustering with cardinality constraints, Computational experience with exterior point algorithms for the transportation problem, Treatment of combinatorial optimization problems using selection equations with cost terms. II: NP-hard three-dimensional assignment problems, Treatment of combinatorial optimization problems using selection equations with cost terms. I: Two-dimensional assignment problems
