Finding Embedded Network Rows in Linear Programs I. Extraction Heuristics
From MaRDI portal
Publication:3780758
DOI10.1287/mnsc.34.3.342zbMath0639.90064OpenAlexW2139607474MaRDI QIDQ3780758
Robert Fourer, Robert E. Bixby
Publication date: 1988
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1911/101605
heuristic techniquescolumn-scanning deletionlarge embedded networksrow-scanning additionrow-scanning deletion
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Linear programming (90C05)
Related Items
Dynamic factorization in large-scale optimization, AXIS: A framework for interactively combining structured algorithms and knowledge based systems, A heuristic based on negative chordless cycles for the maximum balanced induced subgraph problem, A smooth penalty function algorithm for network-structured problems, Use of hidden network structure in the set partitioning problem, The structure of bases in bicircular matroids, A survey of dynamic network flows, Extracting pure network submatrices in linear programs using signed graphs., The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs, 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, Computational implementation of Fujishige's graph realizability algorithm, Solving embedded generalized network problems
Uses Software
