Skip to main content
Springer Nature Link
Log in

Euclidean Combinatorial Configurations: Continuous Representations and Convex Extensions

  • Conference paper
  • First Online:
Lecture Notes in Computational Intelligence and Decision Making (ISDMCI 2019)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 1020))

Abstract

This paper presents general approaches to continuous functional representations (f-representations) of sets of Euclidean combinatorial configurations underlying the possibility of applying continuous programming to optimization on them. A concept of Euclidean combinatorial configurations (e-configurations) is offered. Applications of f-representations in optimization and reformulations of extreme combinatorial problems as global optimization problems are outlined. A typology of f-representations is presented and approaches to construct them for classes that were singled out are described and applied in forming a number of polynomial f-representations of basic sets of e-configurations related to permutation and Boolean configurations. The paper’s results can be applied in solving numerous real-world problems formulated as permutation-based, binary or Boolean.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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

Institutional subscriptions

Similar content being viewed by others

References

  1. Berge C (1971) Principles of combinatorics. Academic Press, New York

    MATH  Google Scholar 

  2. Bertsekas D, Nedic A, Ozdaglar A, Nedic A (2003) Convex analysis and optimization. Athena Scientific, Belmont

    MATH  Google Scholar 

  3. Blum-Smith B, Coskey S (2017) The fundamental theorem on symmetric polynomials: history’s first whiff of Galois theory. Coll Math J 48:18–29. https://doi.org/10.4169/college.math.j.48.1.18

    Article  MathSciNet  MATH  Google Scholar 

  4. Bochnak J, Coste M, Roy M-F (1998) Real algebraic geometry. Springer, Berlin, New York

    Book  Google Scholar 

  5. Gerasin SN, Shlyakhov VV, Yakovlev SV (2008) Set coverings and tolerance relations. Cybern Syst Anal 44:333–340. https://doi.org/10.1007/s10559-008-9007-y

    Article  MATH  Google Scholar 

  6. Gotoh J, Uryasev S, Gotoh J, Uryasev S (2016) Two pairs of families of polyhedral norms versus \(\ell _p\)-norms: proximity and applications in optimization. Math Program 156:391–431. https://doi.org/10.1007/s10107-015-0899-9

    Article  MathSciNet  MATH  Google Scholar 

  7. Grande F (2015) On k-level matroids: geometry and combinatorics. http://www.diss.fu-berlin.de/diss/receive/FUDISS_thesis_000000100434

  8. Hartshorne R (1983) Algebraic geometry. Springer, New York

    MATH  Google Scholar 

  9. Grebennik IV, Kovalenko AA, Romanova TE, Urniaieva IA, Shekhovtsov SB (2018) Combinatorial configurations in balance layout optimization problems. Cybern Syst Anal 54:221–231. https://doi.org/10.1007/s10559-018-0023-2

    Article  MathSciNet  MATH  Google Scholar 

  10. Koliechkina LM, Dvirna OA (2017) Solving extremum problems with linear fractional objective functions on the combinatorial configuration of permutations under multicriteriality. Cybern Syst Anal 53(4):590–599. https://doi.org/10.1007/s10559-017-9961-3

    Article  MATH  Google Scholar 

  11. Koliechkina LN, Dvernaya OA, Nagornaya AN (2014) Modified coordinate method to solve multicriteria optimization problems on combinatorial configurations. Cybern Syst Anal 50(4):620–626. https://doi.org/10.1007/s10559-014-9650-4

    Article  MATH  Google Scholar 

  12. Koliechkina L, Pichugina O (2018) Multiobjective optimization on permutations with applications. In: DEStech transactions on computer science and engineering. Supplementary volume OPTIMA 2018, pp 61–75. https://doi.org/10.12783/dtcse/optim2018/27922

  13. Pavlikov K, Uryasev S (2014) CVaR norm and applications in optimization. Optim Lett 8:1999–2020. https://doi.org/10.1007/s11590-013-0713-7

    Article  MathSciNet  MATH  Google Scholar 

  14. Pichugina O, Farzad B (2016) A human communication network model. In: CEUR workshop proceedings. KNU, Kyiv, pp 33–40

    Google Scholar 

  15. Pichugina O (2017) Placement problems in chip design: modeling and optimization. In: 2017 4th international scientific-practical conference problems of infocommunications. Science and technology (PIC S&T), pp 465–473. https://doi.org/10.1109/INFOCOMMST.2017.8246440

  16. Pichugina O, Yakovlev S (2016) Convex extensions and continuous functional representations in optimization, with their applications. J Coupled Syst Multiscale Dyn 4(2):129–152. https://doi.org/10.1166/jcsmd.2016.1103

    Article  Google Scholar 

  17. Pichugina OS, Yakovlev SV (2016) Continuous representations and functional extensions in combinatorial optimization. Cybern Syst Anal 52(6):921–930. https://doi.org/10.1007/s10559-016-9894-2

    Article  MathSciNet  MATH  Google Scholar 

  18. Pichugina OS, Yakovlev SV (2016) Functional and analytic representations of the general permutation. Eastern-Eur J Enterp Technol 79(4):27–38. https://doi.org/10.15587/1729-4061.2016.58550

    Article  Google Scholar 

  19. Pichugina O, Yakovlev S (2017) Optimization on polyhedral-spherical sets: theory and applications. In: 2017 IEEE 1st Ukraine conference on electrical and computer engineering, UKRCON 2017 - Proceedings. KPI, Kiev, pp 1167–1174. https://doi.org/10.1109/UKRCON.2017.8100436

  20. Rockafellar RT (1996) Convex analysis. Princeton University Press, Princeton

    Google Scholar 

  21. Shekhovtsov SB, Yakovlev SV (1989) Formalization and solution of a class of covering problems in the design of monitoring and control systems. Avtomat i Telemekh 5:160–168

    MathSciNet  MATH  Google Scholar 

  22. Stoyan Y, Romanova T (2013) Mathematical models of placement optimisation: two- and three-dimensional problems and applications. In: Fasano G, Pintér J (eds) Modeling and optimization in space engineering. Springer, New York, pp 363–388

    MATH  Google Scholar 

  23. Stoyan YG, Semkin VV, Chugay AM (2014) Optimization of 3D objects layout into a multiply connected domain with account for shortest distances. Cybern Syst Anal 50:374–385. https://doi.org/10.1007/s10559-014-9626-4

    Article  MathSciNet  MATH  Google Scholar 

  24. Stoyan YG, Yakovlev SV (2018) Configuration space of geometric objects. Cybern Syst Anal 716–726. https://doi.org/10.1007/s10559-018-0073-5

    Article  MathSciNet  Google Scholar 

  25. Stoyan YG, Yakovlev SV, Parshin OV (1991) Quadratic optimization on combinatorial sets in R\(^{\rm n}\). Cybern Syst Anal 27:561–567. https://doi.org/10.1007/BF01130367

    Article  MathSciNet  Google Scholar 

  26. Stoyan YG, Yakovlev SV, Emets OA, Valuĭskaya OA (1998) Construction of convex continuations for functions defined on a hypersphere. Cybern Syst Anal 34:27–36. https://doi.org/10.1007/BF02742066

    Article  MathSciNet  MATH  Google Scholar 

  27. Tuy H (2016) Convex analysis and global optimization. Springer, New York

    Book  Google Scholar 

  28. Vinzant C (2011) Real algebraic geometry in convex optimization

    Google Scholar 

  29. Yakovlev SV (1989) Bounds on the minimum of convex functions on Euclidean combinatorial sets. Cybernetics 25:385–391. https://doi.org/10.1007/BF01069996

    Article  MathSciNet  MATH  Google Scholar 

  30. Yakovlev SV (1994) The theory of convex continuations of functions on vertices of convex polyhedra. Comp Math Math Phys 34:1112–1119

    MathSciNet  Google Scholar 

  31. Yakovlev SV (2018) On some classes of spatial configurations of geometric objects and their formalization. J Autom Inform Sci 50:38–50. https://doi.org/10.1615/JAutomatInfScien.v50.i9.30

    Article  Google Scholar 

  32. Yakovlev S (2017) Convex extensions in combinatorial optimization and their applications. In: Optimization methods and applications. Springer, Cham, pp 567–584. https://doi.org/10.1007/978-3-319-68640-0_27

    Chapter  Google Scholar 

  33. Yakovlev SV (2017) The method of artificial space dilation in problems of optimal packing of geometric objects. Cybern Syst Anal 53:725–731. https://doi.org/10.1007/s10559-017-9974-y

    Article  MATH  Google Scholar 

  34. Yakovlev S, Kartashov O, Yarovaya O (2018) On class of genetic algorithms in optimization problems on combinatorial configurations. In: 2018 IEEE 13th international scientific and technical conference on computer sciences and information technologies (CSIT), pp 374–377. https://doi.org/10.1109/STC-CSIT.2018.8526746

  35. Yakovlev SV, Pichugina OS (2018) Properties of combinatorial optimization problems over polyhedral-spherical sets. Cybern Syst Anal 54(1):99–109. https://doi.org/10.1007/s10559-018-0011-6

    Article  MATH  Google Scholar 

  36. Yakovlev S, Pichugina O, Yarovaya O (2018) On optimization problems on the polyhedral-spherical configurations with their properties. In: 2018 IEEE first international conference on system analysis intelligent computing (SAIC), pp 94–100. https://doi.org/10.1109/SAIC.2018.8516801

  37. Yakovlev S, Pichugina O, Yarovaya O (2019) Polyhedral spherical configuration in discrete optimization. J Autom Inf Sci 51(1):38–50

    Article  Google Scholar 

  38. Ziegler GM (1995) Lectures on polytopes. Springer, New York

    Book  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. National Aerospace University “Kharkiv Aviation Institute”, 17 Chkalova Street, Kharkiv, 61070, Ukraine

    Oksana Pichugina & Sergiy Yakovlev

Authors
  1. Oksana Pichugina
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sergiy Yakovlev
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Oksana Pichugina .

Editor information

Editors and Affiliations

  1. Kherson National Technical University, Kherson, Ukraine

    Volodymyr Lytvynenko

  2. Jan Evangelista Purkyně University in Ústi and Labem, Usti and Labem, Czech Republic

    Sergii Babichev

  3. Lublin University of Technology, Lublin, Poland

    Waldemar Wójcik

  4. IT Step University, Lviv, Ukraine

    Olena Vynokurova

  5. Kherson National Technical University, Kherson, Ukraine

    Svetlana Vyshemyrskaya

  6. Kherson National Technical University, Kherson, Ukraine

    Svetlana Radetskaya

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Pichugina, O., Yakovlev, S. (2020). Euclidean Combinatorial Configurations: Continuous Representations and Convex Extensions. In: Lytvynenko, V., Babichev, S., Wójcik, W., Vynokurova, O., Vyshemyrskaya, S., Radetskaya, S. (eds) Lecture Notes in Computational Intelligence and Decision Making. ISDMCI 2019. Advances in Intelligent Systems and Computing, vol 1020. Springer, Cham. https://doi.org/10.1007/978-3-030-26474-1_5

Download citation

Publish with us

Policies and ethics

Search

Navigation

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy