.png){kind=icon}
.png){kind=icon}
Return
Column generation in the integral simplex method
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2007.09.037.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The integral simplex method for set partitioning problems allows only pivots-on-one to be made, which results in a primal all-integer method. In this technical note we outline how to tailor the column generation principle to this method. Because of the restriction to pivots-on-one, only local optimality can be guaranteed, and to ensure global optimality we consider the use of implicit enumeration. (C) 2007 Elsevier B.V. All rights reserved.
Keywords:
Integer programming
Set partitioning
Column generation
Implicit enumeration
Quasi-integrality
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W