Abstract
Partitioned preassigned pivot procedure. A procedure for arranging the basis matrix of a linear-programming problem into as near a lower triangular form as possible. Such an arrangement helps in maintaining a sparse inverse, given that the original data set for the associated linear-programming problem is sparse.
Cite
CITATION STYLE
APA
Hoffman, K. L., Padberg, M., & Rinaldi, G. (2013). Traveling Salesman Problem BT - Encyclopedia of Operations Research and Management Science. In Encyclopedia of Operations Research and Management Science (pp. 1573–1578). Springer US. Retrieved from http://link.springer.com/10.1007/978-1-4419-1153-7_1068 http://dx.doi.org/10.1007/978-1-4419-1153-7_1068
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free