Skip to main content
SpringerLink
Log in
Book cover

Proceedings of the Third European Conference on Mathematics in Industry pp 303–311Cite as

A Tree Search Approach Based on an Assignment Relaxation for the Solution of Set Covering Problems

  • Chapter

  • 244 Accesses

Part of the book series: European Consortium for Mathematics in Industry ((ECMI,volume 5))

Abstract

An assignment relaxation for the set covering problem (SCP) is introduced and discussed. A tree search method is then developed which makes use of this relaxation. Computational experience of processing a collection of test problems is reported. The work reported here constitutes a part of a generalised tree search method for the solution of the SCP which is described in [11]

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   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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. Baker, E., and Fisher, M.: Computational results for very large air crew scheduling problems. Omega, 9, 613–618, (1981)

    Article  Google Scholar 

  2. Balas, E.: A class of location, distribution and scheduling problems: modelling and solution methods. Rev. Belge Stat. Inform. Recherche Oplle. 22, 36–57, (1983)

    Google Scholar 

  3. Balas, E., and Ho, A.: Set covering algorithms using cutting planes, heuristics and subgradient optimization:A new computational study. Math. Prog. Stud. 12, 37–60, (1980)

    MathSciNet  MATH  Google Scholar 

  4. Balas, E., and Padberg, M.W.: Set partitioning: A survey. SIAM Review, 18, 710–760, (1976)

    Article  MathSciNet  MATH  Google Scholar 

  5. Breu, R., and Burdet, C.A.: Branch and bound experiments in 0–1 programming. Math. Prog. Stud. 2, 1–50, (1974)

    MathSciNet  Google Scholar 

  6. Christofides, N.: Vehicle routing. in Travelling salesman problem. Lawler, E.L., Lenstra, J.K., Rinooy Khan, A.H.G., and Shmays, D.S., eds, Academic Press, (1985)

    Google Scholar 

  7. Dantzig, G.: Linear programming and extensions. Princeton University Press, Princeton, New Jersey, (1963)

    MATH  Google Scholar 

  8. Daskin, M.S., and Stern, E.D.: A hierarchical objective set covering model for emergency medical service vehicle deployment. Transp. Sci. 15, 137–152, (1981)

    Article  MathSciNet  Google Scholar 

  9. E, El-Darzi.: Methods for solving the set covering and set partitioning problems using graph theoretic (relaxation) algorithms. Brunel University, PhD thesis, (1988)

    Google Scholar 

  10. E, El-Darzi., and G, Mitra.: Set covering and set partitioning: A collection of test problems. Brunel University, Internal Report, (1988). To appear in Omega

    Google Scholar 

  11. E, El-Darzi., and G, Mitra.: A tree search approach for the solution of set problems using alternative relaxations. Brunel University, Internal Report, (1988)

    Google Scholar 

  12. Ford, L., and Fulkerson, D.: flows in networks. Princeton University Press, (1962)

    MATH  Google Scholar 

  13. Frieze, A.: Private communication. (1985)

    Google Scholar 

  14. Fulkerson, D.R., Nemhauser, G.L., and Trotter, L.E.: Two computationally difficult set covering problems that arises in computing the 1-Width of incidence matrices of Steiner triple systems. Math. Prog. Stud. 2, 72–81, (1974)

    Google Scholar 

  15. Garfinkel, R.S., and Nemhauser, G.L.: Integer programming. Wiley, (1972)

    Google Scholar 

  16. Geoffrion, A.M.: Lagrangean relaxation for integer programming. Math. Prog. Stud. 2, 82–114, (1974)

    MathSciNet  Google Scholar 

  17. Mitra, G.: Investigation of some branch and bound strategies for the solution of mixed integer linear programs. Math. Prog. 4, 150–170, (1973)

    Article  Google Scholar 

  18. Mitra, G., and Darby-Dowman, K.: CRU-SCHED A computer based bus crew scheduling system using integer programming. in Computer scheduling of public transport. Rousseau, J.-M., Ed., North Holland, (1985)

    Google Scholar 

  19. Murty, K.G.: Linear and combinatorial programming. John Wiley and Sons, (1976)

    MATH  Google Scholar 

  20. Shapiro, J.F.: A survey of lagrangean techniques for discrete optimization. Ann. Discrete Math. 5, 113–138, (1979)

    Article  MathSciNet  MATH  Google Scholar 

  21. Williams, H.P.: Model building in mathematical programming. John Wiley and Sons, (1985)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept of Math., Brunel University, Uxbridge, Middlx, UB8 3PH, England

    Elia El-Darzi & Gautam Mitra

Authors
  1. Elia El-Darzi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gautam Mitra
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Strathclyde, Glasgow, UK

    John Manley (Lecturer in Industrial Mathematics), Sean McKee (Professor of Industrial Mathematics) & David Owens (Professor of Dynamics and Control) (Lecturer in Industrial Mathematics),  (Professor of Industrial Mathematics) &  (Professor of Dynamics and Control)

Rights and permissions

Reprints and permissions

Copyright information

© 1990 B. G. Teubner Stuttgart and Kluwer Academic Publishers

About this chapter

Cite this chapter

El-Darzi, E., Mitra, G. (1990). A Tree Search Approach Based on an Assignment Relaxation for the Solution of Set Covering Problems. In: Manley, J., McKee, S., Owens, D. (eds) Proceedings of the Third European Conference on Mathematics in Industry. European Consortium for Mathematics in Industry, vol 5. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-0629-7_30

Download citation

  • DOI: https://doi.org/10.1007/978-94-009-0629-7_30

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-010-6770-6

  • Online ISBN: 978-94-009-0629-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation