Skip to main content
SpringerLink
Log in
Book cover

Symposium on the Theory of Scheduling and Its Applications pp 143–163Cite as

On The Set Representation and Set Covering Problems

  • Conference paper

Part of the book series: Lecture Notes in Economics and Mathematical Systems ((LNE,volume 86))

Abstract

Give a finite set Γ = {l, 2,..., n} and a class C = {c1, c2... cm} of nonempty subsets of Γ, a subset E⊂Γ is said to represent the class C if

$$ E\; \cap \;{c_{{i\;}}} \ne \;\Phi $$

for all ci ε C The minimum cardinality set representation problem for C is the problem of finding a minimum cardinality subset of Γ representing the class C.

This research has been supported by the National Science Foundation under Contract no. GK-27872 with the University of Michigan

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Balas, E. and M. W. Padberg. “On the Set Covering Problem”. W.P. #74–69–7, Management Science Research Group, Carnegie-Mellon University, Feb., 1970.

    Google Scholar 

  2. Balinski, M. L. “Integer Programming: Methods, Uses, Computation”, Proceedings of the Princeton Symposium on Mathematical Programming, 1970.

    Google Scholar 

  3. Edmonds, J. “Covers and Packings in a Family of Sets”, Bulletin American Mathematical Society, 68, pp. 494–99, 1962.

    Article  Google Scholar 

  4. Garfinkel, R. S. “Set Covering A Survey”, Graduate School of Management, University of Rochester, July 1970.

    Google Scholar 

  5. Glover, F. “A Note on Extreme Point Solutions and a Paper by Lemke, Salkin and Spielberg”, Operations Research, 19, No. 4, July-Aug., 1971, 1023–1025.

    Article  Google Scholar 

  6. Lawler, E. L. “Covering Problems, Duality Relations and a New Method of Solution”, SIAM, Applied Mathematics, 14, No. 5. Sept., 1966, pp. 1115–1132.

    Article  Google Scholar 

  7. Lemke, C. E., H. M. Salkin and K. Spielberg, “Set Covering by Single Branch Enuemration with Linear Programming Subproblems”, Operations Research, 19, No. 4, July-Aug., 1971, 998–1022.

    Article  Google Scholar 

  8. Murty, Katta G. “A Fundamental Problem in Linear Inequalities with Applications to the Traveling Salesman Problem”. Mathemathical Programming. 2, No. 3 June 19 72, pp. 296–308.

    Article  Google Scholar 

  9. Murty, Katta G. “Adjacency on Convex Polyhedra”, SIAM Review, 13, No. 3, pp. 377–386, July, 1971.

    Article  Google Scholar 

  10. Murty, Katta G. “An Algorithm for Generating all the Complementary Feasible Bases for a Linear Complementarity Problem”, Department of Industrial and Operations Engineering, The University of Michigan, 1971.

    Google Scholar 

  11. Roth, R. “Computer Solutions to Minimum Cover Problems”, Operations Research, 17, pp. 455–465, 1969.

    Article  Google Scholar 

  12. Salkin, H. M., and R. D. Koncal. “A Pseudoual All-Integer Algorithm for the Set Covering Problem”, Technical Memorandum 204, Operations Research Department, Case Western Reserve University, Nov., 19 70.

    Google Scholar 

  13. Balinski, M. L. and R. Quandt. “On an Integer Program for a Delivery Problem”, Operations Reserach, 13, 300–304, 1964.

    Article  Google Scholar 

  14. Day, R. H. “On Optimal Extracting from a multiple File Data Storage System: An Application of Integer Programming”, Operations Research, 13, No. 3, 482–494, 1965.

    Article  Google Scholar 

  15. Salveson, M. E. “The Assembly Line Balancing Problem”, Journal of Industrial Engineering, 6, No. 3, 18–25, 1955.

    Google Scholar 

  16. Arabeyre, J. P., J. Fearnley, F. C., Steiger, W. Teather. “The Airline Crew Scheduling Problem” A Survey” Transportation Science, 3, 140–163, May 1969.

    Article  Google Scholar 

  17. Hakimi, S. L. “Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems”, Operations Research, 13, No. 3, 462–475, 1965.

    Article  Google Scholar 

  18. Keller, E. L., “Quadratic Optimization and Linear Complementarity,” Ph.D. dissertation, Dept. of Mathematics, University of Michigan, 1969.

    Google Scholar 

  19. Kuhn, H. W., “An Algorithm for Equilibrium Points in Bimatrix Games,” Proc. Nat. Acad. Sci., USA, Vol. 47, pp. 1657–1662, 1961.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The University of Michigan, Ann Arbor, Michiga, USA

    K. G. Murty

Authors
  1. K. G. Murty
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Grad. Program in Operations Research, North Carolina State University, Box 5511, 27607, Raleigh, NC, USA

    Salah E. Elmaghraby

Rights and permissions

Reprints and permissions

Copyright information

© 1973 Springer-Verlag Berlin · Heidelberg

About this paper

Cite this paper

Murty, K.G. (1973). On The Set Representation and Set Covering Problems. In: Elmaghraby, S.E. (eds) Symposium on the Theory of Scheduling and Its Applications. Lecture Notes in Economics and Mathematical Systems, vol 86. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-80784-8_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-80784-8_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-06437-4

  • Online ISBN: 978-3-642-80784-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation