Abstract
When solving large-scale integer programming (IP) models, there are the conflicting goals of solution quality and solution time. Solving realistic-size instances of many problems to optimality is still beyond the capability of state-of-the-art solvers. However, by reducing the size of the solution space, such as by fixing variables, good primal solutions frequently can be found quickly. © 2012 Springer-Verlag.
Cite
CITATION STYLE
Hewitt, M., Nemhauser, G. L., & Savelsbergh, M. (2012). Branch-and-price guided search. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7422 LNCS, pp. 15–18). https://doi.org/10.1007/978-3-642-32147-4_2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
