Pages that link to "Item:Q3920989"
From MaRDI portal
The following pages link to Identification of special structure constraints in linear programs (Q3920989):
Displaying 7 items.
- The practical conversion of linear programmes to network flow models (Q757237) (← links)
- Dynamic versions of set covering type public facility location problems (Q1167656) (← links)
- Detecting embedded pure network structures in LP problems (Q1265245) (← links)
- Dynamic factorization in large-scale optimization (Q1330893) (← links)
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs (Q3757690) (← links)
- Variations and extensions of Proll's integer linear programming formulation techniques for the graph partitioning problem (Q4008221) (← links)
- Use of hidden network structure in the set partitioning problem (Q5101414) (← links)
