Pages that link to "Item:Q2875612"
From MaRDI portal
The following pages link to Integral Simplex Using Decomposition for the Set Partitioning Problem (Q2875612):
Displaying 17 items.
- ISUD (Q46200) (← links)
- All-integer column generation for set partitioning: basic principles and extensions (Q296975) (← links)
- The weighted uncapacitated planned maintenance problem: complexity and polyhedral properties (Q322558) (← links)
- Influence of the normalization constraint on the integral simplex using decomposition (Q729804) (← links)
- Improved integral simplex using decomposition for the set partitioning problem (Q1616829) (← links)
- Integral simplex using decomposition with primal cutting planes (Q1683694) (← links)
- Dynamic penalization of fractional directions in the integral simplex using decomposition: application to aircrew scheduling (Q1694842) (← links)
- Linear fractional approximations for master problems in column generation (Q1728318) (← links)
- Avoiding redundant columns by adding classical Benders cuts to column generation subproblems (Q2019426) (← links)
- Distributed integral column generation for set partitioning problems (Q2139355) (← links)
- Dynamic constraint aggregation for solving very large-scale airline crew pairing problems (Q2226471) (← links)
- Integral simplex using double decomposition for set partitioning problems (Q2273675) (← links)
- Improving set partitioning problem solutions by zooming around an improving direction (Q2288990) (← links)
- Vector Space Decomposition for Solving Large-Scale Linear Programs (Q4971568) (← links)
- Stabilized Column Generation Via the Dynamic Separation of Aggregated Rows (Q5086013) (← links)
- Integral Column Generation for Set Partitioning Problems with Side Constraints (Q5106424) (← links)
- Integer programming column generation: accelerating branch-and-price using a novel pricing scheme for finding high-quality solutions in set covering, packing, and partitioning problems (Q6095737) (← links)
