Abstract
OMP, a general solver for industrial LP and MIP models, is based on the simplex and branch and bound algorithms. Performance has been substantially improved through the implementation of various techniques, which reduce the model size and prune the branch and bound tree. Furthermore, the basic algorithms have been made faster, and the choice of branching variables has been sophisticated. The model reduction techniques include variable and constraint elimination and substitution. Pruning of the branch and bound tree is obtained by sharpening variable bounds, applying coefficient reduction to the constraints, and generating cuts.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin · Heidelberg
About this paper
Cite this paper
Van hamme, L., Van Looveren, A. (1994). Results on Preprocessing, Postprocessing and Node Processing in Industrial LP And MIP Models. In: Operations Research Proceedings 1993. Operations Research Proceedings, vol 1993. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-78910-6_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-78910-6_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57862-8
Online ISBN: 978-3-642-78910-6
eBook Packages: Springer Book Archive