IDEAS home Printed from https://ideas.repec.org/h/spr/spochp/978-3-319-68640-0_5.html
   My bibliography  Save this book chapter

Lexicographic Search of Optimal Solutions of Boolean Programming Problems

In: Optimization Methods and Applications

Author

Listed:
  • Sergey V. Chupov

    (Uzhhorod National University)

Abstract

Practical problems of optimization have always demanded effective algorithms for search of their solutions. Nowadays, due to the considerable development of computer aids and various technologies, in particular technologies of parallel calculations, there is a need for development of new algorithms and methods that would allow to receive optimal or close to them solutions within an acceptable time. It is especially urgent in connection with the significant increase in dimension of modern applied tasks. In this work such methods and algorithms are being constructed for the purpose of increase in efficiency of the algorithm of lexicographic search of the solution of Boolean optimization problems.

Suggested Citation

  • Sergey V. Chupov, 2017. "Lexicographic Search of Optimal Solutions of Boolean Programming Problems," Springer Optimization and Its Applications, in: Sergiy Butenko & Panos M. Pardalos & Volodymyr Shylo (ed.), Optimization Methods and Applications, pages 75-95, Springer.
  • Handle: RePEc:spr:spochp:978-3-319-68640-0_5
    DOI: 10.1007/978-3-319-68640-0_5
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:spochp:978-3-319-68640-0_5. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.