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

DOI10.1007/BF02591862zbMath0571.90090OpenAlexW2030087549MaRDI QIDQ3688125

No author found.

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

decompositionbipartite graphoptimal solutionlinear relaxationmax-flow problemc-matchingweighted r-covering problem

Mathematics Subject Classification ID

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

Related Items (1)

A rounding algorithm for integer programs

Cites Work

• An \(O(IVI^3)\) algorithm for finding maximum flows in networks
• Minimum node covers and 2-bicritical graphs
• An extension of the edge covering problem
• Vertex packings: Structural properties and algorithms
• Unnamed Item

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