Heuristically aided set-covering algorithms

DOI10.1007/BF01355587zbMath0276.65037MaRDI QIDQ4401517

R. Michael Harnett, James P. Ignizio

Publication date: 1974

Published in: International Journal of Computer & Information Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Algorithms in computer science (68W99)

Related Items (1)

Determination of minimum number of sensors and their locations for an automated facility: An algorithmic approach

Cites Work

• Integer Programming and Pricing
• Computer Solutions of the Traveling Salesman Problem
• Computer Solutions to Minimum-Cover Problems
• An Improved Implicit Enumeration Approach for Integer Programming
• Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems
• Unnamed Item
• Unnamed Item

This page was built for publication: Heuristically aided set-covering algorithms