Pages that link to "Item:Q1348247"
From MaRDI portal
The following pages link to On some difficult linear programs coming from set partitioning (Q1348247):
Displaying 13 items.
- A hybrid soft computing approach for subset problems (Q474017) (← links)
- 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)
- Layering strategies for creating exploitable structure in linear and integer programs (Q1117840) (← links)
- An algorithm for large scale 0-1 integer programming with application to airline crew scheduling (Q1897393) (← links)
- Bregman proximal relaxation of large-scale 0-1 problems (Q1967121) (← links)
- A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints (Q2010923) (← links)
- Optimal set-partitioning based on group quality likelihood using partition-growing algorithm (Q2874033) (← links)
- A parallel, linear programming-based heuristic for large-scale set partitioning problems (Q2884506) (← links)
- Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut (Q3430946) (← links)
- (Q5020878) (← links)
- Searching for optimal integer solutions to set partitioning problems using column generation (Q5416769) (← links)
