×

Found 681 Documents (Results 1–100)

Structural optimization of a longitudinally moving layered web based on a multi-criteria approach. (English. Russian original) Zbl 07788184

Mech. Solids 58, No. 4, 1184-1192 (2023); translation from Izv. Ross. Akad. Nauk, Mekh. Tverd. Tela 2023, No. 4, 167-177 (2023).
PDFBibTeX XMLCite
Full Text: DOI

Method for false extrema localization in global optimization. (English. Russian original) Zbl 07786648

Dokl. Math. 108, No. 1, 309-311 (2023); translation from Dokl. Ross. Akad. Nauk, Mat. Inform. Protsessy Upr. 512, 78-80 (2023).
MSC:  90C26
PDFBibTeX XMLCite
Full Text: DOI

Semi-supervised \(k\)-means clustering via DC programming approach. (English) Zbl 1528.90196

Khachay, Michael (ed.) et al., Mathematical optimization theory and operations research. 22nd international conference, MOTOR 2023, Ekaterinburg, Russia, July 2–8, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13930, 54-67 (2023).
MSC:  90C26 62H30 90C90
PDFBibTeX XMLCite
Full Text: DOI

Numerical algorithm for solving a class of optimization problems with a constraint in the form of a subset of points of a smooth surface. (English. Russian original) Zbl 07643667

Comput. Math. Math. Phys. 62, No. 12, 2033-2040 (2022); translation from Zh. Vychisl. Mat. Mat. Fiz. 62, No. 12, 2018-2025 (2022).
MSC:  65-XX 90-XX
PDFBibTeX XMLCite
Full Text: DOI

Sufficient conditions for a minimum of a strongly quasiconvex function on a weakly convex set. (English. Russian original) Zbl 1489.90114

Math. Notes 111, No. 1, 33-46 (2022); translation from Mat. Zametki 111, No. 1, 39-53 (2022).
MSC:  90C25
PDFBibTeX XMLCite
Full Text: DOI

K-means clustering via a nonconvex optimization approach. (English) Zbl 1489.90135

Pardalos, Panos (ed.) et al., Mathematical optimization theory and operations research. 20th international conference, MOTOR 2021, Irkutsk, Russia, July 5–10, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12755, 462-476 (2021).
MSC:  90C26 90C27
PDFBibTeX XMLCite
Full Text: DOI

Gradient projection method for a class of optimization problems with a constraint in the form of a subset of points of a smooth surface. (English. Russian original) Zbl 1467.90072

Comput. Math. Math. Phys. 61, No. 3, 368-375 (2021); translation from Zh. Vychisl. Mat. Mat. Fiz. 61, No. 3, 391-399 (2021).
MSC:  90C30
PDFBibTeX XMLCite
Full Text: DOI

Improving a branch-and-bound approach for the degree-constrained minimum spanning tree problem with LKH. (English) Zbl 07636036

Hebrard, Emmanuel (ed.) et al., Integration of constraint programming, artificial intelligence, and operations research. 17th international conference, CPAIOR 2020, Vienna, Austria, September 21–24, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12296, 447-456 (2020).
MSC:  68T20 90Bxx 90C27
PDFBibTeX XMLCite
Full Text: DOI Link

Distributed minimum vertex coloring and maximum independent set in chordal graphs. (English) Zbl 07561665

Rossmanith, Peter (ed.) et al., 44th international symposium on mathematical foundations of computer science, MFCS 2019, Aachen, Germany, August 26–30, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 138, Article 21, 15 p. (2019).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI

Circuit lower bounds for MCSP from local pseudorandom generators. (English) Zbl 1499.68101

Baier, Christel (ed.) et al., 46th international colloquium on automata, languages, and programming, ICALP 2019, Patras, Greece, July 9–12, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 132, Article 39, 14 p. (2019).
MSC:  68Q06 68Q17
PDFBibTeX XMLCite
Full Text: DOI

Genetic local search for conflict-free minimum-latency aggregation scheduling in wireless sensor networks. (English) Zbl 1464.90029

Evtushenko, Yury (ed.) et al., Optimization and applications. 9th international conference, OPTIMA 2018, Petrovac, Montenegro, October 1–5, 2018. Revised selected papers. Cham: Springer. Commun. Comput. Inf. Sci. 974, 216-231 (2019).
MSC:  90B35 90B18 90C59
PDFBibTeX XMLCite
Full Text: DOI

Numerical algorithm for minimizing a convex function on the intersection of a smooth surface and a convex compact set. (English. Russian original) Zbl 1437.65050

Comput. Math. Math. Phys. 59, No. 7, 1098-1104 (2019); translation from Zh. Vychisl. Mat. Mat. Fiz. 59, No. 7, 1151-1157 (2019).
PDFBibTeX XMLCite
Full Text: DOI

The structure of the set of local minima of functions in various spaces. (English. Russian original) Zbl 1429.54023

Sib. Math. J. 60, No. 3, 398-404 (2019); translation from Sib. Mat. Zh. 60, No. 3, 518-526 (2019).
MSC:  54C30 54E99
PDFBibTeX XMLCite
Full Text: DOI

Sequential and parallel algorithms and data structures. The basic toolbox. (English) Zbl 1445.68003

Cham: Springer (ISBN 978-3-030-25208-3/hbk; 978-3-030-25209-0/ebook). xv, 509 p. (2019).
PDFBibTeX XMLCite
Full Text: DOI

Gradient projection method for optimization problems with a constraint in the form of the intersection of a smooth surface and a convex closed set. (English. Russian original) Zbl 1431.90147

Comput. Math. Math. Phys. 59, No. 1, 34-45 (2019); translation from Zh. Vychisl. Mat. Mat. Fiz. 59, No. 1, 37-49 (2019).
MSC:  90C30 65K05
PDFBibTeX XMLCite
Full Text: DOI

Approximating dominating set on intersection graphs of rectangles and L-frames. (English) Zbl 1512.68400

Potapov, Igor (ed.) et al., 43rd international symposium on mathematical foundations of computer science. MFCS 2018, Liverpool, United Kingdom, August 27–31, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 117, Article 37, 15 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

An efficient local search for the minimum independent dominating set problem. (English) Zbl 1496.90076

D’Angelo, Gianlorenzo (ed.), 17th symposium on experimental algorithms, SEA 2018, June 27–29, 2018, L’Aquila, Italy. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 103, Article 13, 13 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Brief announcement: Distributed minimum vertex coloring and maximum independent set in chordal graphs. (English) Zbl 1428.68384

Proceedings of the 37th ACM symposium on principles of distributed computing, PODC ’18, Egham, UK, July 23–27, 2018. New York, NY: Association for Computing Machinery (ACM). 159-161 (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

A new proof of the Kuhn-Tucker and Farkas theorems. (English. Russian original) Zbl 1408.46069

Comput. Math. Math. Phys. 58, No. 7, 1035-1039 (2018); translation from Zh. Vychisl. Mat. Mat. Fiz. 58, No. 7 (2018).
Reviewer: Rita Pini (Milano)
MSC:  46N10 90C30 90C46
PDFBibTeX XMLCite
Full Text: DOI

On integrating an iterated variable neighborhood search within a bi-objective genetic algorithm: sum coloring of graphs case application. (English) Zbl 1408.90345

Coelho, Vitor Nazário (ed.) et al., Selected short papers of the 5th international conference on variable neighborhood search (ICVNS’17), Ouro Preto, Brazil, 2–4, 2017. Amsterdam: Elsevier. Electron. Notes Discrete Math. 66, 55-62 (2018).
MSC:  90C59 90C29 05C15
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software