An efficient algorithm for minimumk-covers in weighted graphs

DOI10.1007/BF01580426MaRDI QIDQ4083700zbMATH OpenOpenAlexFDO

Authors Lee J. White, Mark L. Gillenson

Publication date 1975

Published in Mathematical Programming (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Programming involving graphs or networks (90C35)

Cites work

• An Algorithm for a Minimum Cover of a Graph
• Covers and packings in a family of sets
• Establishing the matching polytope
• Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
• scientific article; zbMATH DE number 3334901 (Why is no real title available?)
• scientific article; zbMATH DE number 3409134 (Why is no real title available?)
• Integer Programming: Methods, Uses, Computations
• Maximum matching and a polyhedron with 0,1-vertices
• Minimum Covers of Fixed Cardinality in Weighted Graphs
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Paths, Trees, and Flowers
• TWO THEOREMS IN GRAPH THEORY

Cited in

(7)

• Fuzzy minimum weight edge covering problem
• Forest covers and a polyhedral intersection theorem
• Lot-sizing polyhedra with a cardinality constraint
• Cluster generation and grouping using mathematical programming
• Constrained weighted matchings and edge coverings in graphs
• An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
• Edge covering problem under hybrid uncertain environments

This page was built for publication: An efficient algorithm for minimumk-covers in weighted graphs

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