An extension of the edge covering problem

DOI10.1007/BF01583800MaRDI QIDQ3941210zbMATH OpenOpenAlexFDO

Authors

Publication date 1982

Published in Mathematical Programming (Search for Journal in Brave)

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

zbMATH Keywords

linear relaxationoptimum solutionrounding offvertex r-packing problemweighted edge covering problemweighted r-covering problem

Mathematics Subject Classification ID

Integer programming (90C10) Programming involving graphs or networks (90C35)

Cites work

• scientific article; zbMATH DE number 3361920 (Why is no real title available?)
• scientific article; zbMATH DE number 3410784 (Why is no real title available?)
• Order in Logic and Integral Domains
• Vertex packings: Structural properties and algorithms

Cited in

(2)

• A rounding algorithm for integer programs
• A decomposition algorithm for linear relaxation of the weightedr-covering problem

This page was built for publication: An extension of the edge covering problem

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