The minimum cut cover problem

DOI10.1016/j.endm.2011.05.044zbMath1268.05202OpenAlexW2040251994MaRDI QIDQ2840718

Edna A. Hoshino

Publication date: 23 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2011.05.044

zbMATH Keywords

integer programmingheuristicbranch-and-priceminimum cut cover

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Minimum Scan Cover with Angular Transition Costs ⋮ Identifying defective network components through restricted group testing

Cites Work

• Minimal cut cover of a graph with an application to the testing of electronic boards
• Greedy randomized adaptive search procedures
• Unnamed Item
• Unnamed Item

This page was built for publication: The minimum cut cover problem