.png){kind=icon}
.png){kind=icon}
Return
Dual variable based fathoming in dynamic programs for column generation
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2003.05.006.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this note, we aim at reducing the state space of dynamic programming algorithms used as column generators in solving the linear programming relaxation of set partitioning problems arising from practical applications. We propose a simple generic lower bounding criterion based on the respective dual optimal solution of the restricted master program. (C) 2003 Elsevier B.V. All rights reserved.
Keywords:
dynamic programming
column generation
state space reduction
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
Organization
No organization information available