Abo Bibliothek: Guest
Journal of Automation and Information Sciences

Erscheint 12 Ausgaben pro Jahr

ISSN Druckformat: 1064-2315

ISSN Online: 2163-9337

SJR: 0.173 SNIP: 0.588 CiteScore™:: 2

Indexed in

Solving a Continuous Single-product Problem of Optimal Partitioning with Additional Conditions

Volumen 41, Ausgabe 7, 2009, pp. 48-63
DOI: 10.1615/JAutomatInfScien.v41.i7.30
Get accessGet access

ABSTRAKT

Consideration was given to a continuous linear single-product problem of optimal partitioning a set Ω from n-measurable Euclidean space into subsets with allocation of their centers and additional conditions like constraints on communication throughputs. The method and algorithm of this problem solution are presented.

REFERENZIERT VON
  1. Borisovsky Pavel, Dolgui Alexandre, Kovalev Sergey, Modelling transfer line design problem via a set partitioning problem, Optimization Letters, 6, 5, 2012. Crossref

  2. Stoyan Y. G., Yakovlev S. V., Theory and Methods of Euclidian Combinatorial Optimization: Current Status and Prospects, Cybernetics and Systems Analysis, 56, 3, 2020. Crossref

  3. Hart Liudmyla, Combined Approach to Solving the Neumann Problem for a Parametric Quasilinear Elliptic Equation, in Advances in Computer Science for Engineering and Manufacturing, 463, 2022. Crossref

  4. Kiseleva Elena, Prytomanova Olga, Hart Liudmyla, Blyuss Oleg, Application of the Theory of Optimal Set Partitioning for Constructing Fuzzy Voronoi Diagrams, in System Analysis & Intelligent Computing, 1022, 2022. Crossref

  5. G Yaskov, A Chugay, T Romanova, S Shekhovtsov, Modern method of topology optimization of products in additive production, Artificial Intelligence, 27, jai2022.27(1), 2022. Crossref

Digitales Portal Digitale Bibliothek eBooks Zeitschriften Referenzen und Berichte Forschungssammlungen Preise und Aborichtlinien Begell House Kontakt Language English 中文 Русский Português German French Spain