Skip to main content
SpringerLink
Log in
Book cover

Optimization Methods and Applications pp 75–95Cite as

Lexicographic Search of Optimal Solutions of Boolean Programming Problems

  • Chapter
  • First Online:

  • 1237 Accesses

Part of the book series: Springer Optimization and Its Applications ((SOIA,volume 130))

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.

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

Notes

  1. 1.

    http://people.brunel.ac.uk/~mastjjb/~jeb/~orlib/~mknapinfo.html.

References

  1. Balev, S., Yanev, N., Freville, A., Andonov, R.: A dynamic programming based reduction procedure for the multidimensional 0–1 knapsack problem. Eur. J. Oper. Res. 186, 63–76 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  2. Benlic, U., Hao, J.K.: Breakout local search for the max-cut problem. J. Eng. Appl. Artif. Intell. 26(3), 1162–1173 (2013)

    Article  MATH  Google Scholar 

  3. Burer, S., Monteiro, R.D.C., Zhang, Y.: Rank-two relaxation heuristics for max-cut and other binary quadratic programs. SIAM J. Optim. 12, 503–521 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  4. Chervak, Y.Y.: Optimization. Not improvable choice. Uzhhorod National University, Uzhorod (2002) (in Ukrainian)

    MATH  Google Scholar 

  5. Chu, P.C., Beasley, J.E.: A genetic algorithm for the multidimensional knapsack problem. J. Heuristics 4, 63–86 (1998)

    Article  MATH  Google Scholar 

  6. Chupov, S.V.: The stochastic algorithm of lexicographical search of the solution of Boolean multidimensional knapsack problem. In: Proceedings of the VII International Summer School “Decision theory”, pp. 263–264. Uzhhorod National University, Uzhgorod (2014) (in Ukrainian)

    Google Scholar 

  7. Chupov, S.V.: Modification of the algorithm of lexicographic maximum of set search. Nauk. Visnyk Uzhorod. Univ. Ser. Mat. i Inform. 2(27), 168–173 (2015) (in Ukrainian)

    Google Scholar 

  8. Chupov, S.V.: New approaches to solving discrete programming problems on the basis of lexicographic search. Cybern. Syst. Anal. (2016). https://doi.org/10.1007/s10559-016-9855-9

  9. Chupov, S.V.: Structural and stochastic properties of the lexicographic search algorithm for the solution of a discrete optimization problem. Comput. Math. 1(1), 155–164 (2016) (in Ukrainian)

    Google Scholar 

  10. Chupov, S.V.: The algorithm of stochastic lexicographical search of the solution of Boolean multidimensional knapsack problem. In: Mathematics of Information Technology: Materials of V International Scientific Conference, pp. 51–52. Vega-Druk, Lutsk (2016) (in Ukrainian)

    Google Scholar 

  11. Chupov, S.V.: The stochastic algorithm of lexicographical search of discrete programming problem. Nauk. Visnyk Uzhorod. Univ. Ser. Mat. i Inform 1(28), 235–244 (2016) (in Ukrainian)

    Google Scholar 

  12. Glover, F., Kochenberger, G.A.: Critical event tabu search for multidimensional knapsack problems. In: Osman, I., Kelly, J.P. (eds.) Metaheuristics: Theory and Applications, pp. 407–427. Kluwer Academic, Boston (1996)

    Google Scholar 

  13. Glover, F., Lu, Z., Hao, J.K.: Diversication-driven tabu search for unconstrained binary quadratic problems. 4OR 8, 239–253 (2010)

    Google Scholar 

  14. Pardalos, P.M., Prokopyev, O.A., Shylo, O.V., Shylo, V.P.: Global equilibrium search applied to the unconstrained binary quadratic optimization problem. Optim. Methods Softw. 23, 129–140 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  15. Sergienko, I.V., Shylo, V.P.: Discrete Optimization Problems: Challenges, Solution Techniques and Analysis. Naukova Dumka, Kyiv (2003) (in Russian)

    MATH  Google Scholar 

  16. Shylo, V.P.: The method of global equilibrium search. Cybern. Syst. Analysis 35(1), 68–74 (1999)

    Article  MathSciNet  Google Scholar 

  17. Shylo, V.P., Shylo, O.V., Roschyn, V.A.: Solving weighted max-cut problem by global equilibrium search. Cybern. Syst. Anal. 48(4), 563–567 (2012)

    Article  MathSciNet  Google Scholar 

  18. Shylo, V.P., Roschyn, V.O., Shylo, P.V.: Construction of algorithm portfolio for parallelization the solving process of WMAXCUT problem. Comput. Math. (2) (2014) (in Russian)

    Google Scholar 

  19. Vasquez, M., Hao, J.K.: A hybrid approach for the 0–1 multidimensional knapsack problem. In: Proceedings of the International Joint Conference on Artificial Intelligence, pp. 328–333. Seattle, Washington (2001)

    Google Scholar 

  20. Vasquez, M., Vimont, Y.: Improved results on the 0–1 multidimensional knapsack problem. Eur. J. Oper. Res. 165, 70–81 (2005)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Uzhhorod National University, 3 Narodna Square, 88000, Uzhhorod, Transcarpathian Region, Ukraine

    Sergey V. Chupov

Authors
  1. Sergey V. Chupov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sergey V. Chupov .

Editor information

Editors and Affiliations

  1. Industrial & Systems Engineering, Texas A&M University, College Station, Texas, USA

    Sergiy Butenko

  2. Department of Industrial and Systems Engineering, University of Florida, Gainesville, Florida, USA

    Panos M. Pardalos

  3. Methods of Discrete Optimization, V.M. Glushkov Institute of Cybernetics, Kyiv, Ukraine

    Volodymyr Shylo

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Chupov, S.V. (2017). Lexicographic Search of Optimal Solutions of Boolean Programming Problems. In: Butenko, S., Pardalos, P., Shylo, V. (eds) Optimization Methods and Applications . Springer Optimization and Its Applications, vol 130. Springer, Cham. https://doi.org/10.1007/978-3-319-68640-0_5

Download citation

Publish with us

Policies and ethics

Search

Navigation