.png){kind=icon}
.png){kind=icon}
Return
Bi-dynamic constraint aggregation and subproblem reduction
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2006.10.007.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Dynamic constraint aggregation was recently introduced by Elhallaoui et al. [Dynamic aggregation of set partitioning constraints in column generation. Operations Research 2005; 53: 632-45] for efficiently solving the linear relaxation of a class of set partitioning type problems in a column generation context. It reduces the master problem size by aggregating some of its constraints and updates this aggregation when needed. In this paper, we present an advanced version of the dynamic constraint aggregation that reduces both the master problem and the subproblem sizes. This version is called the bi-dynamic constraint aggregation method because aggregation is dynamically applied to both the master problem and the subproblem. We also discuss solution integrality. Computational results for the mass transit simultaneous vehicle and crew scheduling problem are reported. (c) 2006 Elsevier Ltd. All rights reserved.
Keywords:
dynamic constraint aggregation
set partitioning
column generation
degeneracy
subproblem reduction
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W
Organization
No organization information available