Pages that link to "Item:Q1396918"
From MaRDI portal
The following pages link to Primal cutting plane algorithms revisited (Q1396918):
Displaying 13 items.
- On the enumerative nature of Gomory's dual cutting plane method (Q607496) (← links)
- Influence of the normalization constraint on the integral simplex using decomposition (Q729804) (← links)
- Adding activities to the dual instead of cuts to the primal problem (Q1097165) (← links)
- Integral simplex using decomposition with primal cutting planes (Q1683694) (← 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)
- Convex analysis in groups and semigroups: a sampler (Q2413078) (← links)
- Linear-programming-based lifting and its application to primal cutting-plane algorithms (Q2901054) (← links)
- On the Relative Complexity of 15 Problems Related to 0/1-Integer Programming (Q2971619) (← links)
- (Q3035141) (← links)
- A primal-dual cutting-plane algorithm for all-integer programming (Q3320128) (← links)
- Integral Column Generation for Set Partitioning Problems with Side Constraints (Q5106424) (← links)
- Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation (Q5962716) (← links)
