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

DOI10.1023/A:1008791601215zbMATH Open0947.90014OpenAlexW1554088932MaRDI QIDQ1567484FDOQ1567484

Authors: Nalân Gülpinar, G. Gutin, Gautam Mitra, István Maros 

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

Recommendations

• Detecting embedded pure network structures in LP problems
• Automatic identification of embedded network rows in large-scale optimization models
• Extracting embedded generalized networks from linear programming problems
• scientific article; zbMATH DE number 3858846

zbMATH Keywords

linear programmingindependent setsnetwork programminggeneralized upper bounds

Mathematics Subject Classification ID

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

Cited In (6)

• Finding Embedded Network Rows in Linear Programs I. Extraction Heuristics
• Some further results on minimum distribution cost flow problems
• A heuristic based on negative chordless cycles for the maximum balanced induced subgraph problem
• Title not available (Why is that?)
• 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: Detecting embedded networks in LP using GUB structures and independent set algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1567484)