A new solution for the general set covering problem

  • László Béla Kovács
Mathematical Programming
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3)


Feasible Solution Disjunctive Normal Form Route Planning Prime Implicant Group Theoretic Approach 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Arabeyre, et all The Airline-Crew Scheduling Problem: A Survay. Transportation Science, 3 /1969/ No 2.Google Scholar
  2. [2]
    M.L.Balinski, On Maximum Matching, Minimum Covering and their Connections. Proceedings of the Princeton Symposium on Mathematical programming. /1970/ 303–312Google Scholar
  3. [3]
    M. Belmore and D. Ratliff, Set Covering and Involuntary Bases, Management Science 18 /1971/ 194–206Google Scholar
  4. [4]
    R.S. Garfinkel and G.L. Nemhouser, The Set-Partitioning Problem: Set Covering with Equality constraints. Operations Research 17/1969/ 848–856.Google Scholar
  5. [5]
    R.E. Gomory, An Algorithm for Integer Solutions of Linear Programs, 269–302 in [6].Google Scholar
  6. [6]
    R.L.Graves and Ph.Wolfe /eds./ Recent Advances in Mathematical Programming, McGraw-Hill /1963/Google Scholar
  7. [7]
    R.W.House, L.O.Nelson, and T.Rado, Computer Studies of a Certain Class of Linear Integer Problems. Recent Advances of Optimization Techniques. Lavi and Vogl /eds./ Wiley /1966/ pp. 241–280.Google Scholar
  8. [8]
    E.L. Lawler and D.E. Wood, "Branch-and-Bound Methods: A Survey", Operations Research, 14 /1966/ 699–719.Google Scholar
  9. [9]
    C.E. Lemke, H.Salkin and K.Spielberg, Set Covering By Single Branch Enumeration with Linear Programming Subproblems Operations Research /to appear/Google Scholar
  10. [10]
    G.T.Martin, An Accelerated Enclidean Algorithm for Integer Linear Programs, 311–318 in [6]Google Scholar
  11. [11]
    H. Thiriez, The Set Covering Problem: A Group Theoretic Approach Revue Trancaise de Recherche Operationelle V-3 /1971/ 83–104.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1973

Authors and Affiliations

  • László Béla Kovács
    • 1
  1. 1.Computer and Automation InstituteHungarian Academy of SciencesHungary

Personalised recommendations