Skip to main content
SpringerLink
Log in

Branch-and-Bound Method for Just-in-Time Optimization of Radar Search Patterns

  • Chapter
  • First Online:
Nature-Inspired Methods for Metaheuristics Optimization

Part of the book series: Modeling and Optimization in Science and Technologies ((MOST,volume 16))

Abstract

Set covering is a well-known problem in combinatorial optimization. The objective is to cover a set of elements, called the universe, using a minimum number of available covers. The theoretical problem is known to be generally NP-difficult to solve [1], and is often encountered in industrial processes and real-life problem. In particular, the mathematical formulation of the set cover problem is well-suited for radar search pattern optimization of modern radar systems.

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

Access this chapter

Log in via an institution
eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 139.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 139.99
Price excludes VAT (USA)
  • Durable hardcover 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

Institutional subscriptions

References

  1. Vazirani VV (2001) Approximation algorithms. Springer, New York

    MATH  Google Scholar 

  2. Briheche Y, Barbaresco F, Bennis F, Chablat D, Gosselin F (2016) Non-uniform constrained optimization of radar search patterns in direction cosines space using integer programming. In: 2016 17th International Radar Symposium (IRS)

    Google Scholar 

  3. Yelbay B, Birbil Şİ, Bülbül K (2015) The set covering problem revisited: an empirical study of the value of dual information. J Ind Manag Optim 11(2):575–594

    MathSciNet  MATH  Google Scholar 

  4. Matouek J, Gärtner B (2006) Understanding and using linear programming (universitext). Springer, New York/Secaucus

    Google Scholar 

  5. Nemhauser GL, Wolsey LA (1988) Integer and combinatorial optimization. Wiley-Interscience, New York

    Book  Google Scholar 

  6. Briheche Y, Barbaresco F, Bennis F, Chablat D (2018) Theoretical complexity of grid cover problems used in radar applications. J Optim Theory Appl 179(3):1086–1106 [Online]. https://doi.org/10.1007/s10957-018-1354-x

    Article  MathSciNet  Google Scholar 

  7. Conforti M, Cornuejols G, Zambelli G (2014) Integer programming. Springer Publishing Company, Incorporated

    MATH  Google Scholar 

  8. Skolnik M (2008) Radar handbook, 3rd edn. McGraw-Hill Education, New York

    Google Scholar 

  9. IBM ILOG CPLEX Optimization Studio, v12.6 (2015) http://www-03.ibm.com/software/products/en/ibmilogcplestud/

Download references

Acknowledgements

This work is partly supported by a DGA-MRIS scholarship.

Author information

Authors and Affiliations

  1. Thales Air Systems, Voie Pierre-Gilles de Gennes, Limours, France

    Yann Briheche & Frederic Barbaresco

  2. Laboratoire des Sciences du Numérique de Nantes, UMR CNRS 6004, Nantes, France

    Yann Briheche, Fouad Bennis & Damien Chablat

Authors
  1. Yann Briheche
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Frederic Barbaresco
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Fouad Bennis
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Damien Chablat
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yann Briheche .

Editor information

Editors and Affiliations

  1. Ecole Central de Nantes, Nantes cedex 3, France

    Fouad Bennis

  2. Department of Civil Engineering, Indian Institute of Technology Guwahati, Guwahati, Assam, India

    Rajib Kumar Bhattacharjya

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Briheche, Y., Barbaresco, F., Bennis, F., Chablat, D. (2020). Branch-and-Bound Method for Just-in-Time Optimization of Radar Search Patterns. In: Bennis, F., Bhattacharjya, R. (eds) Nature-Inspired Methods for Metaheuristics Optimization. Modeling and Optimization in Science and Technologies, vol 16. Springer, Cham. https://doi.org/10.1007/978-3-030-26458-1_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-26458-1_25

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-26457-4

  • Online ISBN: 978-3-030-26458-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation