A heuristic for finding embedded network structure in mathematical programmes

DOI10.1016/0377-2217(93)90321-DzbMath0783.90067OpenAlexW2010373185MaRDI QIDQ1261396

P. J. Maye, Barrie M. Baker

Publication date: 28 September 1993

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(93)90321-d

zbMATH Keywords

heuristicnetwork flow

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Linear programming (90C05) Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (5)

Extracting pure network submatrices in linear programs using signed graphs. ⋮ An exact approach to the problem of extracting an embedded network matrix ⋮ A heuristic for finding embedded network structure in mathematical programmes ⋮ Detecting embedded pure network structures in LP problems ⋮ Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs

Cites Work

• Unnamed Item
• Unnamed Item
• The practical conversion of linear programmes to network flow models
• An efficient PQ-graph algorithm for solving the graph-realization problem
• A heuristic for finding embedded network structure in mathematical programmes
• Graphs and Vector Spaces
• Automatic identification of embedded network rows in large-scale optimization models
• Finding Embedded Network Rows in Linear Programs I. Extraction Heuristics
• An Almost Linear-Time Algorithm for Graph Realization
• Converting Linear Programs to Network Problems
• The simplex SON algorithm for LP/embedded network problems

This page was built for publication: A heuristic for finding embedded network structure in mathematical programmes