Pages that link to "Item:Q3315283"
From MaRDI portal
The following pages link to Automatic identification of embedded network rows in large-scale optimization models (Q3315283):
Displaying 10 items.
- A heuristic based on negative chordless cycles for the maximum balanced induced subgraph problem (Q342319) (← links)
- The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs (Q708779) (← links)
- An exact approach to the problem of extracting an embedded network matrix (Q716336) (← links)
- The practical conversion of linear programmes to network flow models (Q757237) (← links)
- A survey of dynamic network flows (Q917417) (← links)
- A network relaxation based enumeration algorithm for set partitioning (Q1123128) (← links)
- A heuristic for finding embedded network structure in mathematical programmes (Q1261396) (← links)
- Detecting embedded pure network structures in LP problems (Q1265245) (← links)
- Dynamic factorization in large-scale optimization (Q1330893) (← links)
- Extracting pure network submatrices in linear programs using signed graphs. (Q1427813) (← links)