Pages that link to "Item:Q1348247"
From MaRDI portal
The following pages link to On some difficult linear programs coming from set partitioning (Q1348247):
Displayed 4 items.
- Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem (Q817190) (← links)
- A dual ascent procedure for the set partitioning problem (Q955334) (← links)
- Two ``well-known'' properties of subgradient optimization (Q1016352) (← links)
- Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut (Q3430946) (← links)