Výsledky vyhľadávania - Vector Boolean programming problem

On stability and quasi-stability of a vector lexicographic quadratic boolean programming problem: On stability and quasi-stability of a vector lexicographic quadratic Boolean programming problem

Autori: V.A. Emelichev V. Nikulin

Zdroj: Journal of Numerical Analysis and Approximation Theory, Vol 30, Iss 1 (2001)

Predmety: Sensitivity, stability, parametric optimization, QA1-939, Boolean programming, vector Boolean programming, stability, Mathematics

Popis súboru: application/xml

Prístupová URL adresa: https://zbmath.org/1864560
https://doaj.org/article/43737cbc4dda4ac5ab6d3fce582d1632
https://doaj.org/article/f9dacab2eef744598eae30d3238b3252

On stability of a Pareto optimum of a vector Boolean programming problem

Autori: V.N. Krichko V.A. Emelichev

Zdroj: Discrete Mathematics and Applications. 9

Predmety: Sensitivity, stability, parametric optimization, 0211 other engineering and technologies, Integer programming, Boolean programming, stability radius, quasi-stability radius, 02 engineering and technology, Pareto optimum, 0101 mathematics, 01 natural sciences, Multi-objective and goal programming

Popis súboru: application/xml

Prístupová URL adresa: https://zbmath.org/1548652
https://doi.org/10.1515/dma.1999.9.6.607
http://www.degruyter.com/downloadpdf/j/dma.1999.9.issue-6/dma.1999.9.6.607/dma.1999.9.6.607.xml

On quasi-stability of the vector Boolean problem of minimizing absolute deviations of linear functions from zero

Autori: Emelichev, V.A. Gurevsky, E.E.

Zdroj: Computer Science Journal of Moldova, Vol 14, Iss 2(41), Pp 207-218 (2006)
Computer Science Journal of Moldova 41 (2) 207-218

Predmety: Dvector Boolean programming problem, Electronic computers. Computer science, 0211 other engineering and technologies, vector Boolean programming problem, quasi-stability radius, 02 engineering and technology, QA75.5-76.95, 0101 mathematics, Pareto set, 01 natural sciences, quasi-stability

Popis súboru: application/pdf

Prístupová URL adresa: https://doaj.org/article/d539a8ff2ff841bfa530bc4c99d53421
https://ibn.idsi.md/vizualizare_articol/2330

Sensitivity analysis of efficient solution in vector MINMAX boolean programming problem

Autori: Vladimir A. Emelichev Vitaly N. Krichko Yury V. Nikulin

Zdroj: Computer Science Journal of Moldova, Vol 10, Iss 2(29), Pp 136-142 (2002)

Predmety: vector MINMAX Boolean programming problem, efficient solution, stability radius, Electronic computers. Computer science, QA75.5-76.95

Popis súboru: electronic resource

Relation: http://www.math.md/nrofdownloads.php?file=/files/csjm/v10-n2/v10-n2-(pp136-142).pdf; https://doaj.org/toc/1561-4042

Prístupová URL adresa: https://doaj.org/article/b5f14a09b1b74f8e84d6d22a0fb00419

On quasi-stability of the vector Boolean problem of minimizing absolute deviations of linear functions from zero

Autori: Vladimir A. Emelichev Evgeny E. Gurevsky

Zdroj: Computer Science Journal of Moldova, Vol 14, Iss 2(41), Pp 207-218 (2006)

Predmety: Dvector Boolean programming problem, Pareto set, quasi-stability, quasi-stability radius, Electronic computers. Computer science, QA75.5-76.95

Popis súboru: electronic resource

Relation: http://www.math.md/files/csjm/v14-n2/v14-n2-(pp207-218).pdf; https://doaj.org/toc/1561-4042

Prístupová URL adresa: https://doaj.org/article/d539a8ff2ff841bfa530bc4c99d53421

Stability radius of an efficient solution to a vector quadratic problem of Boolean programming.

Autori: Emelichev, V. A. Krichko, V. N.

Predmety: optimal, partial criteria, efficient solution, unique, Multiobjective variational problems, Pareto optimality, applications to economics, etc, vector criterion, General equilibrium theory, Boolean programming, Pareto set, Multi-objective and goal programming

Popis súboru: application/xml

Prístupová URL adresa: https://zbmath.org/1849231

On the radius of stability of a vector problem of linear Boolean programming.

Autori: Emelichev, V.A. Krichko, V.N. Podkopaev, D.P.

Zdroj: Discrete Mathematics & Applications. 2000, Vol. 10 Issue 1, p103. 6p.

Predmety: *BOOLEAN algebra, *LINEAR programming

Sensitive Analysis of a Vector Quadratic Lexicographic Boolean Programming Problem

Autori: Yury Nikulin

Zdroj: Operations Research Proceedings 2001 ISBN: 9783540433446

Prístupová URL adresa: https://rd.springer.com/chapter/10.1007/978-3-642-50282-8_34
https://link.springer.com/chapter/10.1007/978-3-642-50282-8_34

Stability analysis of a strictly efficient solution of a vector problem of Boolean programming in the metric l1.

Autori: Emelichev, V.A. Kuzmin, K.G.

Zdroj: Discrete Mathematics & Applications. 2004, Vol. 14 Issue 5, p521-526. 6p.

Predmety: *BOOLEAN algebra, *LINEAR systems, *SYSTEMS theory, *MATHEMATICS, *ALGORITHMS

Convex Relaxations of (0, 1)-Quadratic Programming

Autori: Poljak, Svatopluk Wolkowicz, Henry

Zdroj: Mathematics of Operations Research, 1995 Aug 01. 20(3), 550-561.

Prístupová URL adresa: https://www.jstor.org/stable/3690169

On stability of a Pareto optimum of a vector Boolean programming problem.

Autori: Emelichev, V.A. Krichko, V.N.

Zdroj: Discrete Mathematics & Applications; 1999, Vol. 9 Issue 6, p607, 7p

Predmety: BOOLEAN algebra, LINEAR programming, VECTOR algebra

Aspects of stability for multicriteria quadratic problems of Boolean programming.

Autori: Emelichev, Vladimir A. Nikulin, Yury V.

Zdroj: Buletinul Academiei de Ştiinţe a Republicii Moldova: Matematica; 2018, Vol. 87 Issue 2, p30-40, 11p

Predmety: BOOLEAN functions, QUADRATIC equations, PERTURBATION theory, STABILITY theory, INTEGER programming

Development of a searching algorithm based on neural networks for the optimal University studies schedule.

Autori: Kvyatkovskaya, I. Khasukhadzhiev, A. Magomaev, T.

Zdroj: AIP Conference Proceedings; 2021, Vol. 2442 Issue 1, p1-10, 10p

Predmety: PROBLEM solving, UNIVERSITIES & colleges, COMPUTER engineering, ALGORITHMS, QUADRATIC programming, SEARCH algorithms

DEVELOPMENT OF DECISIONMAKING TECHNOLOGY FOR THE PROVISION OF SERVICES IN PROJECT IMPLEMENTATION.

Alternate Title: РОЗРОБКА ТЕХНОЛОГІЇ ПРИЙНЯТТЯ РІШЕНЬ ЩОДО НАДАННЯ ПОСЛУГ ПРИ РЕАЛІЗАЦІЇ ПРОЄКТІВ. (Ukrainian)

Autori: Mulesa, Oksana Yakob, Evgen Valko, Petro a ďalší

Zdroj: Technology Audit & Production Reserves; 2024, Vol. 2 Issue 2(76), p13-17, 5p

Predmety: DECISION support systems, INFORMATION technology, MATHEMATICAL models, DECISION making, INFORMATION design, LINEAR programming

Stability measure of multicriteria integer linear programming problem with a parametric optimality principle ; Мера устойчивости многокритериальной задачи целочисленного линейного программирования с параметрическим принципом оптимальности

Autori: V. A. Emelichev S. E. Bukhtoyarov В. А. Емеличев a ďalší

Prispievatelia: V. A. Emelichev S. E. Bukhtoyarov В. А. Емеличев a ďalší

Zdroj: Proceedings of the National Academy of Sciences of Belarus. Physics and Mathematics Series; Том 58, № 2 (2022); 179-189 ; Известия Национальной академии наук Беларуси. Серия физико-математических наук; Том 58, № 2 (2022); 179-189 ; 2524-2415 ; 1561-2430 ; 10.29235/1561-2430-2022-58-2

Predmety: норма Гёльдера, integer linear programming problem, parametric principle of optimality, lexicographic principle of optimality, Pareto optimality, stability radius, Hölder’s norm, задача целочисленного линейного программирования, параметрический принцип оптимальности, лексикографический принцип оптимальности, оптимальность по Парето, радиус устойчивости

Popis súboru: application/pdf

Relation: https://vestifm.belnauka.by/jour/article/view/642/530; Hadamard, J. Lectures on Cauchy’s problem in linear partial differential equations / J. Hadamard. – Yale: Yale University Press, 1923. – 338 p.; Сергиенко, И. В. Исследование устойчивости и параметрический анализ дискретных оптимизационных задач / И. В. Сергиенко, Л. Н. Козерацкая, Т. Т. Лебедева. – Киев: Наук. думка, 1995. – 170 с.; Сергиенко, И. В. Задачи дискретной оптимизации. Проблемы, методы решения, исследования / И. В. Сергиенко, В. П. Шило. – Киев: Наук. думка, 2003. – 261 с.; Устойчивость и эффективные алгоритмы решения задач дискретной оптимизации с многими критериями и неполной информацией / В. А. Емеличев [и др.] // Проблемы управления и информатики. – 2014. – № 1. – С. 53–67.; Лебедева, Т. Т. Разные типы устойчивости векторной задачи целочисленной оптимизации: общий подход / Т. Т. Лебедева, Т. И. Сергиенко // Кибернетика и систем. анализ. – 2008. – Т. 44, № 3. – С. 142–148.; Kuzmin, K. On necessary and sufficient conditions of stability and quasistability in combinatorial multicriteria optimization / K. Kuzmin, Yu. Nikulin, M. Makela // Control and Cybernetics. – 2017. – Vol. 46, № 4. – P. 361–382.; Леонтьев, В. К. Дискретная оптимизация / В. К. Леонтьев // Журн. вычисл. математики и мат. физики. – 2007. – Т. 47, № 2. – С. 338–352.; Емеличев, В. А. О радиусе устойчивости векторной инвестиционной задачи с критериями минимаксного риска Сэвиджа / В. А. Емеличев, В. В. Коротков // Кибернетика и систем. анализ. – 2012. – Т. 48, № 3. – С. 68–77.; Емеличев, В. А. Постоптимальный анализ векторного варианта одной инвестиционной задачи / В. А. Емеличев, В. И. Мычков // Тр. Ин-та математики. – 2016. – Т. 24, № 1. – С. 9–18.; Emelichev, V. On a quasistability radius for multicriteria integer linear programming problem of finding extremum solutions / V. Emelichev, Yu. Nikulin // Кибернетика и систем. анализ. – 2019. – Т. 55, № 6. – С. 80–89.; Emelichev, V. Post-optimal analysis for multicriteria integer linear programming problem with parametric optimality / V. Emelichev, Yu. Nikulin // Control and Cybernetics. – 2020. – Vol. 49, № 2. – P. 163–178.; Гордеев, Э. Н. Сравнение трех подходов к исследованию устойчивости решений задач дискретной оптимизации и вычислительной геометрии / Э. Н. Гордеев // Дискрет. анализ и исслед. операций. – 2015. – Т. 22, вып. 3. – С. 18–35.; Бухтояров, С. Е. Аспекты устойчивости многокритериальной задачи целочисленного линейного программирования / С. Е. Бухтояров, В. А. Емеличев // Дискрет. анализ и исслед. операций. – 2019. – Т. 26, № 1. – С. 5–19. https://doi.org/10.33048/daio.2019.26.624; Emelichev, V. A. Stability measures for multicriteria quadratic Boolean programming problem of finding extremum solutions / V. A. Emelichev, Y. V. Nikulin // Тр. Ин-та математики. – 2017. – Т. 25, № 2. – С. 82–90.; Scheduling under uncertainty. Theory and algorithms / Y. Sotskov [et al.]. – Minsk: Belaruskaya nauka, 2010. – 328 p.; Nikulin, Y. Accuracy and stability functions for a problem of minimization a linear form on a set of substitutions / Y. Nikulin // Sequencing and Scheduling with Inaccurate Data / eds.: Y. Sotskov, F. Werner. – Nova Science Pub Inc., 2014. – Ch. 15. – P. 409–426.; Емеличев, В. А. О количественной мере устойчивости векторной задачи целочисленного программирования / В. А. Емеличев, Д. П. Подкопаев, // Журн. вычисл. математики и мат. физики. – 1998. – Т. 38, № 11. – С. 1801–1805.; Stability and regularization of vector problem of integer linear programming / V. Emelichev [et al.] // Optimization. – 2002. – Vol. 51, № 4. – P. 645–676. https://doi.org/10.1080/0233193021000030760; Емеличев, В. А. О радиусе устойчивости векторной задачи целочисленного линейного программирования в случае регулярности нормы в критериальном пространстве / В. А. Емеличев, К. Г. Кузьмин // Кибернетика и систем. анализ. – 2010. – Т. 46, № 1. – С. 82–89.; Emelichev, V. A. Estimates of stability radius of multicriteria Boolean problem with Hölder metrics in parameter spaces / V. A. Emelichev, K. G. Kuzmin, V. I. Mychkov // Bull. Acad. Sci. Moldova. Math. – 2015. – № 2 (78). – P. 74–81.; Emelichev, V. Post-optimal analysis for multicriteria integer linear programming problem of finding extremum solutions / V. Emelichev, Yu. Nikulin // Control and Cybernetics. – 2018. – Vol. 47, № 3. – P. 225–238.; Emelichev, V. A. On two stability types for a multicriteria integer linear programming problem / V. A. Emelichev, S. E. Bukhtoyarov // Bull. Acad. Sci. Moldova. Math. –2020. – Vol. 92, № 1. – P. 17–30.; Emelichev, V. On one type of stability for multiobjective integer linear programming problem with parameterized optimality / V. Emelichev, Yu. Nikulin // Comput. Sci. J. Moldova. – 2020. – Vol. 28, № 3. – P. 249–268.; Подиновский, В. В. Парето-оптимальные решения многокритериальных задач / В. В. Подиновский, В. Д. Ногин. – М.: Наука, 1982. – 256 с.; Леонтьев, В. К. Устойчивость в линейных дискретных задачах / В. К. Леонтьев // Проблемы кибернетики. – 1979. – Вып. 35. – С. 169–184.; https://vestifm.belnauka.by/jour/article/view/642

Dostupnosť: https://vestifm.belnauka.by/jour/article/view/642
https://doi.org/10.29235/1561-2430-2022-58-2-179-189

vector MINMAX boolean programming problem

Autori: Vladimir A. Emelichev Ci Max The Pennsylvania State University CiteSeerX Archives

Prispievatelia: Vladimir A. Emelichev Ci Max The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.math.md/files/csjm/v10-n3/v10-n3-(pp320-328).pdf.

Predmety: q(x, x ′, C) = (q1(x, C1, q2(x, C2, qn(x, Cn

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.414.6392

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.414.6392
http://www.math.md/files/csjm/v10-n3/v10-n3-(pp320-328).pdf

On stability of an efficient solution of a vector Boolean problem of maximisation of absolute values of linear functions.

Autori: Gurevskii, E. E. Emelichev, V. A.

Zdroj: Discrete Mathematics & Applications. 2007, Vol. 17 Issue 3, p231-236. 6p.

Predmety: *BIVECTORS, *MULTIPLE criteria decision making, *LEAST absolute deviations (Statistics), *LINEAR statistical models, *MATHEMATICAL functions

Probability Bounds with Cherry Trees

Autori: Bukszár, József Prékopa, András

Zdroj: Mathematics of Operations Research, 2001 Feb 01. 26(1), 174-192.

Prístupová URL adresa: https://www.jstor.org/stable/3690442

Dual-bounded generating problems: weighted transversals of a hypergraph

Autori: Boros, E. Gurvich, V.A. Khachiyan, L. a ďalší

Zdroj: Discrete Applied Mathematics. Aug2004, Vol. 142 Issue 1-3, p1-15. 15p.

Predmety: *HYPERGRAPHS, *MATHEMATICAL programming, *MATRICES (Mathematics), *DATABASES, *GRAPH theory

Using the NEOS Server for Solving Two Classes of Optimization Problems

Autori: Halyna Bila Oleksandr Korchynskyy Petro Stetsyuk a ďalší

Zdroj: Кібернетика та комп'ютерні технології, Iss 4, Pp 56-80 (2022)

Predmety: Q300-390, neos solvers, stiefel's manifold, travelling salesman problem, optimization, Cybernetics, neos server, ampl

Prístupová URL adresa: https://doaj.org/article/4baaac5f6055403abed9d106c4df1dc4