A SET COVERING APPLICATION IN MINIMUM ROUTE GENERATION

DOI10.1108/EB005370zbMath0304.90110OpenAlexW2143295643MaRDI QIDQ4060762

Marlin H. Mickle, Ronald G. Hoelzeman, Jong C. Wang

Publication date: 1974

Published in: Kybernetes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1108/eb005370

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Related Items (2)

A METHOD OF OPTIMUM ROUTE REGENERATION ⋮ Simplification of Boolean-valued data by minimum covering

This page was built for publication: A SET COVERING APPLICATION IN MINIMUM ROUTE GENERATION