Lexicographic Search of Optimal Solutions of Boolean Programming Problems

Sergey V. Chupov ()
Additional contact information
Sergey V. Chupov: Uzhhorod National University

A chapter in Optimization Methods and Applications, 2017, pp 75-95 from Springer

Abstract: 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.

Date: 2017
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-319-68640-0_5

Ordering information: This item can be ordered from
http://www.springer.com/9783319686400

DOI: 10.1007/978-3-319-68640-0_5

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().