A decomposition algorithm for linear relaxation of the weightedr-covering problem

DOI10.1007/BF02591862MaRDI QIDQ3688125zbMATH OpenOpenAlexFDO

Authors

Publication date 1985

Published in Mathematical Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02591862

zbMATH Keywords

bipartite graphc-matchingdecompositionlinear relaxationmax-flow problemoptimal solutionweighted r-covering problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Programming involving graphs or networks (90C35)

Recommendations

• Algorithms for large scale set covering problems
• The multicovering problem
• Graph theoretic relaxations of set covering and set partitioning problems

Cites work

• An \(O(IVI^3)\) algorithm for finding maximum flows in networks
• An extension of the edge covering problem
• scientific article; zbMATH DE number 3643026 (Why is no real title available?)
• Minimum node covers and 2-bicritical graphs
• Vertex packings: Structural properties and algorithms

Cited in

(1)

• A rounding algorithm for integer programs

This page was built for publication: A decomposition algorithm for linear relaxation of the weightedr-covering problem

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