A heuristic for finding embedded network structure in mathematical programmes
From MaRDI portal
Recommendations
- Extracting embedded generalized networks from linear programming problems
- Finding Embedded Network Rows in Linear Programs I. Extraction Heuristics
- Detecting embedded pure network structures in LP problems
- scientific article; zbMATH DE number 60242
- Fixed-parameter algorithms in analysis of heuristics for extracting networks in linear programs
- Efficient management of multiple sets to extract complex structures from mathematical programs
- Using Mathematical Programming to Refine Heuristic Solutions for Network Clustering
- scientific article; zbMATH DE number 2063221
- A generalized mathematical theory of structured programming
- An algorithmic toolbox for network calculus
Cites work
- scientific article; zbMATH DE number 3220801 (Why is no real title available?)
- scientific article; zbMATH DE number 3331274 (Why is no real title available?)
- A heuristic for finding embedded network structure in mathematical programmes
- An Almost Linear-Time Algorithm for Graph Realization
- An efficient PQ-graph algorithm for solving the graph-realization problem
- Automatic identification of embedded network rows in large-scale optimization models
- Converting Linear Programs to Network Problems
- Finding Embedded Network Rows in Linear Programs I. Extraction Heuristics
- Graphs and Vector Spaces
- The practical conversion of linear programmes to network flow models
- The simplex SON algorithm for LP/embedded network problems
Cited in
(8)- Detecting embedded pure network structures in LP problems
- Automatic identification of embedded network rows in large-scale optimization models
- A heuristic for finding embedded network structure in mathematical programmes
- Finding Embedded Network Rows in Linear Programs I. Extraction Heuristics
- The practical conversion of linear programmes to network flow models
- An exact approach to the problem of extracting an embedded network matrix
- Extracting pure network submatrices in linear programs using signed graphs.
- Fixed-parameter algorithms in analysis of heuristics for extracting networks in linear programs
This page was built for publication: A heuristic for finding embedded network structure in mathematical programmes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1261396)