Computational Experience in Solving Linear Programs
From MaRDI portal
Publication:5824929
DOI10.1137/0101002zbMath0053.41805OpenAlexW2027923483WikidataQ92409183 ScholiaQ92409183MaRDI QIDQ5824929
Alan J. Hoffman, Daniel Sokolowsky, N. A. Wiegmann, Murray Mannos
Publication date: 1953
Published in: Journal of the Society for Industrial and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0101002
Related Items
Best practices for comparing optimization algorithms ⋮ Karmarkar's projective method for linear programming: a computational survey ⋮ Some Recent Mathematical Developments in Economics† ⋮ On Chubanov's Method for Linear Programming ⋮ A Sampling Kaczmarz--Motzkin Algorithm for Linear Feasibility ⋮ A simple heuristic approach to simplex efficiency ⋮ Measuring the impact of primal heuristics ⋮ On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method ⋮ Reporting computational experiments in mathematical programming ⋮ The confined primal integral: a measure to benchmark heuristic MINLP solvers against global MINLP solvers ⋮ MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library ⋮ Computing in combinatorial optimization ⋮ Motivation for working in numerical analysis ⋮ COCO: a platform for comparing continuous optimizers in a black-box setting
