Heuristically aided set-covering algorithms

DOI10.1007/BF01355587MaRDI QIDQ4401517zbMATH OpenFDO

Authors James P. Ignizio, R. Michael Harnett

Publication date 1974

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

Full work available at URL https://doi.org/10.1007/BF01355587

Mathematics Subject Classification ID

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

Cites work

• An Improved Implicit Enumeration Approach for Integer Programming
• Computer Solutions of the Traveling Salesman Problem
• Computer Solutions to Minimum-Cover Problems
• scientific article; zbMATH DE number 3155211 (Why is no real title available?)
• scientific article; zbMATH DE number 3305071 (Why is no real title available?)
• Integer Programming and Pricing
• Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems

Cited in

(1)

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

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

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