Detecting embedded networks in LP using GUB structures and independent set algorithms

DOI10.1023/A:1008791601215zbMath0947.90014OpenAlexW1554088932MaRDI QIDQ1567484

Gautam Mitra, István Maros, Nalân Gülpinar, Gregory Gutin

Publication date: 29 October 2000

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1008791601215

zbMATH Keywords

linear programmingnetwork programmingindependent setsgeneralized upper bounds

Mathematics Subject Classification ID

Linear programming (90C05) Deterministic network models in operations research (90B10)

Related Items (4)

A heuristic based on negative chordless cycles for the maximum balanced induced subgraph problem ⋮ Extracting pure network submatrices in linear programs using signed graphs. ⋮ Some further results on minimum distribution cost flow problems ⋮ Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs

This page was built for publication: Detecting embedded networks in LP using GUB structures and independent set algorithms