Covering Problems: Duality Relations and a New Method of Solution

DOI10.1137/0114089MaRDI QIDQ5519730zbMATH OpenOpenAlexFDO

Authors Eugene L. Lawler

Publication date 1966

Published in SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/2027.42/6176

zbMATH Keywords

operations research

Cited in

(9)

• Ordered weighted average optimization in multiobjective spanning tree problem
• Graphenalgorithmen und Überdeckungsprobleme
• The characterization of \(p\)-factor-critical graphs
• Construction for bicritical graphs and \(k\)-extendable bipartite graphs
• On discrete optimization with ordering
• Generating minimal redundant and maximal irredundant subhypergraphs
• On a geometric graph-covering problem related to optimal safety-landing-site location
• Covering-based numbers related to the LS-category of finite spaces
• Computational aspects of monotone dualization: a brief survey

This page was built for publication: Covering Problems: Duality Relations and a New Method of Solution

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