Covering Problems: Duality Relations and a New Method of Solution

DOI10.1137/0114089zbMath0143.42402OpenAlexW1998575442MaRDI QIDQ5519730

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

Related Items (6)

On discrete optimization with ordering ⋮ Computational aspects of monotone dualization: a brief survey ⋮ Ordered weighted average optimization in multiobjective spanning tree problem ⋮ Construction for bicritical graphs and \(k\)-extendable bipartite graphs ⋮ Graphenalgorithmen und Überdeckungsprobleme ⋮ The characterization of \(p\)-factor-critical graphs

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