Pages that link to "Item:Q1427813"

The following pages link to Extracting pure network submatrices in linear programs using signed graphs. (Q1427813):

Displaying 11 items.

• A heuristic based on negative chordless cycles for the maximum balanced induced subgraph problem (Q342319) (← links)
• Cycle-based reducibility of multi-index transport-type systems of linear inequalities (Q357096) (← links)
• Multiindex transportation problems with 2-embedded structure (Q384500) (← links)
• Maximum balanced subgraph problem parameterized above lower bound (Q391973) (← links)
• Multi-index transportation problems with 1-nested structure (Q510278) (← links)
• Three-index linear programs with nested structure (Q664295) (← links)
• An exact approach to the problem of extracting an embedded network matrix (Q716336) (← links)
• Evaluating balancing on social networks through the efficient solution of correlation clustering problems (Q1688940) (← links)
• Multi-index transport problems with decomposition structure (Q2261688) (← links)
• The maximum balanced subgraph of a signed graph: applications and solution approaches (Q2356257) (← links)
• A branch-and-cut algorithm for the maximum \(k\)-balanced subgraph of a signed graph (Q2414463) (← links)