Computational Experience in Solving Linear Programs

DOI10.1137/0101002zbMATH Open0053.41805OpenAlexW2027923483WikidataQ92409183 ScholiaQ92409183MaRDI QIDQ5824929FDOQ5824929

Authors: Alan J. Hoffman, Murray Mannos, Daniel Sokolowsky, N. A. Wiegmann 

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

zbMATH Keywords

operations research

Cited In (14)

• A sampling Kaczmarz-Motzkin algorithm for linear feasibility
• Some Recent Mathematical Developments in Economics†
• On Chubanov's Method for Linear Programming
• A simple heuristic approach to simplex efficiency
• Motivation for working in numerical analysis
• Best practices for comparing optimization algorithms
• The confined primal integral: a measure to benchmark heuristic MINLP solvers against global MINLP solvers
• Karmarkar's projective method for linear programming: a computational survey
• Measuring the impact of primal heuristics
• COCO: a platform for comparing continuous optimizers in a black-box setting
• Computing in combinatorial optimization
• Reporting computational experiments in mathematical programming
• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
• MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library

This page was built for publication: Computational Experience in Solving Linear Programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5824929)