?
Handbook of Combinatorial Optimization
Springer, 2025.
Under the general editorship: Pardalos P. M., Du D., Thai M.
The second edition of this 5-volume handbook is intended to be a basic yet comprehensive reference work in combinatorial optimization that will benefit newcomers and researchers for years to come. This multi-volume work deals with several algorithmic approaches for discrete problems as well as with many combinatorial problems. The editors have brought together almost every aspect of this enormous field of combinatorial optimization, an area of research at the intersection of applied mathematics, computer science, and operations research and which overlaps with many other areas such as computation complexity, computational biology, VLSI design, communications networks, and management science. An international team of 30-40 experts in the field form the editorial board.
Chapters
Gribanov D., Malyshev D., , in: Handbook of Combinatorial Optimization.: Springer, 2025. P. 1–97.
The main objective of this text is to provide a comprehensive overview of results related to the group minimization problem on a finite Abelian group, also known as the Gomory group minimization problem, and its applications in integer linear programming, combinatorial optimization, and enumerative combinatorics. Significant attention is also given to the problem of computing ...
Added: November 26, 2025
Panov V., Ryabchenko A., / Series arXiv "stat.ME". 2026. No. 2607.05048.
This paper investigates the problem of statistical inference for a mixture distribution consisting of a discrete and a continuous component, with a particular focus on the class of rational-infinitely divisible distributions. We consider non-parametric estimation of both components of the mixture as well as the quasi-L{é}vy measure, assuming that the mixture belongs to the class ...
Added: July 9, 2026
Surkov A., Ignatenko V., Koltcov Sergei, Computers, Materials and Continua 2026
Large language models have recently demonstrated promising capabilities in mathematical reasoning; however, their performance on tasks requiring strict symbolic manipulation, such as solving differential equations, remains limited, especially for compact models. In this work, we investigate whether activation steering combined with reinforcement learning can improve the quality of solutions generated by pretrained language models without ...
Added: July 8, 2026
Springer, 2027.
The series Lecture Notes in Computer Science (LNCS), including its subseries Lecture Notes in Artificial Intelligence (LNAI) and Lecture Notes in Bioinformatics (LNBI), has established itself as a medium for the publication of new developments in computer science and information technology research, teaching, and education. LNCS enjoys close cooperation with the computer science R & ...
Added: July 8, 2026
IEEE, 2026.
The purpose of the 2026 IEEE Ural-Siberian Conference on Biomedical Engineering, Radioelectronics and Information Technology (USBEREIT) is to bring together researchers and practitioners from multiple areas of radio science, including biomedical engineering, radioelectronics, microelectronics, information technology, smart energy, information security and others. ...
Added: July 8, 2026
Маликов М. А., Монахова Э. А., Rzaev E. et al., Ученые записки Казанского университета. Серия: Физико-математические науки 2026 Т. 168 № 2 С. 269–286
This article examines series of families of two-dimensional circulant networks with rectangular
L -shapes, optimal in diameter, as network-on-chip topologies with a minimal number of crossings
between the links and a bounded length of the maximum link that does not depend on the network
size. New network-on-chip routing algorithms, which use the coordinates of three adjacent zeros in
the ...
Added: July 8, 2026
Pilé I., Shchur L., Deng Y., Physical Review B: Condensed Matter and Materials Physics 2026 Vol. 114 Article 014101
We investigate the spatial overlap of successive spin configurations in Markov chain Monte Carlo simulations using the local Metropolis algorithm and the Swendsen-Wang and Wolff cluster algorithms. We examine the dynamics of these algorithms for models in different universality classes: Ising model, Potts model with three components, and four-state Potts model. The overlap of two ...
Added: July 6, 2026
Irkutsk: ISDCT SB RAS, 2026.
We study a model problem on the filtration of a conducting fluid through a
porous layer. A porous medium is presented as an assemblage of identical spherical
cells. Each cell consists of a porous core and liquid shell. We derive apriori estimates
for flow characteristics which show the specific behavior of the fluid. Our estimates
are validated numerically. ...
Added: July 5, 2026
М.: Наука и технологии, 2026.
«Телекоммуникации» ежемесячный рецензируемый производственный, информационно-аналитический и учебно-методический журнал выходит в свет с июля 2000 г.
Для руководителей и работников промышленности, научно-исследовательских и проектно-конструкторских институтов, высших учебных заведений, аспирантов и студентов, а также для специалистов, разрабатывающих, выпускающих и эксплуатирующих средства телекоммуникаций.
Новости разработок и производства, прогнозы развития, защита информации, Нормативные, справочные, аналитические и учебно-методические материалы.
Переход к глобальному информационному ...
Added: July 4, 2026
МФТИ, 2025.
абота редакции научного журнала «Труды Московского физико-технического института» (кратко «Труды МФТИ»), редакционной коллегии и редакционного совета осуществляется в соответствии с Положением, утвержденным ректором института. В состав редакционной коллегии входят руководители института, факультетов, институтских и факультетских кафедр. Главный редактор журнала —президент МФТИ, член-корр. РАН Кудрявцев Н.Н.
Журнал «Труды МФТИ» входит в базу данных РИНЦ (Российский Индекс Научного Цитирования) и доступен в электронной ...
Added: July 4, 2026
Hualin M., Jie Z., Jerome Y. et al., Journal of Internet Technology 2026 Vol. 27 No. 3 P. 367–382
In open, interference-prone scenarios, the scarcity of precisely annotated signal samples limits the application of deep learning–based modulation identification, which generally relies on extensive labeled data for stability. Relation Networks, as an emerging class of deep learning models, exhibit rapid convergence in few-shot learning tasks. Motivated by the fast convergence property of relation-based learning and ...
Added: July 3, 2026
Osipov D., Информационно-управляющие системы 2026 № 3 С. 49–62
Introduction: In many communication systems under construction and those to be created power control and channel estimation techniques developed for the previous generation communication systems fail to provide desired precision. One way to solve this problem is to use order-statistics-based reception techniques that do not need channel estimation or power control. To ensure the desired ...
Added: July 3, 2026
Springer, 2026.
This book presents established and new research on the close connections between graph games and systems of logic, particularly existing and newly designed modal logics. The volume utilizes two graph games – the sabotage game and the hide-and-seek game – to demonstrate the natural interplay between designing new graph games and exploring new kinds of ...
Added: June 30, 2026
Pochinka O., Barinova M., Journal of Geometry and Physics 2026 Vol. 228 P. 1–8
In the present paper we consider an Ω-stable 3-diffeomorphism with a solid or thickened surfaced non-trivial basic set. Such basic sets include, for instance, all one-dimensional expanding attractors and those two-dimensional basic sets that are not expanding. We prove that the chain recurrent set of every such a diffeomorphism necessarily contains at least two non-trivial ...
Added: June 30, 2026
German O., Illarionov A., Известия РАН. Серия математическая 2026 Т. 90 № 3 С. 3–18
Пусть симплекс с целочисленными вершинами - содержащий ровно одну целочисленную точку, отличную от своих вершин. В работе доказывается, что если точка находится во внутренности симплекса или в относительной внутренности некоторой гиперграни симплекса, то объем симплекса ограничен величиной, зависящей только от размерности, в противном случае объем симплекса может быть сколь угодно большим. Этот результат применяется для вывода асимптотической формулы для среднего числа вершин полиэдров ...
Added: June 29, 2026
Bille A., Buchstaber V., Coste S. et al., Journal of Physics A: Mathematical and Theoretical 2025 Vol. 58 No. 2 Article 025212
We analyze the numbers of closed paths of length on two important regular lattices: the hexagonal lattice (also called graphene in chemistry) and its dual triangular lattice. These numbers form a moment sequence of specific random variables connected to the distance of a position of a planar random flight (in three steps) from the origin. Here, we refer to such ...
Added: August 22, 2025
Khestanov R., Suvalko A., Социологическое обозрение 2025 Т. 24 № 2 С. 164–189
The article examines the genesis of the concept of novelty and argues that modern difficulties in defining and identifying the new are a symptom of a semantic crisis, which is based on the loss of strategic normativity of novelty in modern culture. Three historical-semantic models of novelty are identified and analyzed: cyclical (characteristic of prehistoric ...
Added: June 29, 2025
М.: Математический институт им. В. А. Стеклова РАН, 2024.
This volume is dedicated to the 80th birthday of Victor Matveevich Buchstaber, Corresponding Member of the Russian Academy of Sciences. The volume includes articles on topology, geometry, combinatorics, and mathematical physics, the areas in which V. M. Buchstaber is a recognized world leader and the head of an active scientific school. Most of the articles are written ...
Added: January 15, 2025
Burashnikov E., Operations Research Forum 2024
Added: September 21, 2024
Providence: AMS, 2023.
This book is a translation from Russian of Part III of the book Mathematics via Problems: From Olympiads and Math Circles to Profession. Part I, Algebra, and Part II, Geometry, have been published in the same series.
The main goal of this book is to develop important parts of mathematics through problems. The authors tried to put together sequences ...
Added: March 3, 2024
Ignatov A., , in: 14th International Conference, OPTIMA 2023, Petrovac, Montenegro, September 18–22, 2023, Revised Selected Papers. Communications in Computer and Information Science (CCIS, volume 1913)Vol. 1913.: Springer, 2023. P. 173–187.
Modeling protein folding, which is the process by which a protein obtains its spacial shape, still remains a challenging problem. Protein geometry might be simplified by using the coarse-grained models. The highest level of simplification is achieved in HP-models where only polarity of amino acid residues is considered, and the unified monomers are located in nodes ...
Added: January 18, 2024
Ignatov D. I., , in: FCA4AI 2023 What can FCA do for Artificial Intelligence 2023 Proceedings of the 11th International Workshop "What can FCA do for Artificial Intelligence?" co-located with the 32nd International Joint Conference on Artificial Intelligence (IJCAI 2023) Macao, S.A.R. China; August 20, 2023Vol. 3489.: CEUR-WS.org, 2023. P. 47–56.
The paper aims at not only counting how many basic choice functions exist on a finite set of alternatives (all, non-empty, single-element valued) but shows how to do this with the help of Formal Concept Analysis. Moreover, we introduce the contextual representation of a choice function by considering the formal context of its map from ...
Added: November 23, 2023
Springer, 2022.
The 21 full papers presented together with 6 invited abstracts lectures and 2 tutorial abstracts in this volume were carefully reviewed and selected from 88 submissions. The conference focuses on the following topics: Mathematical programming, bi-level and global optimization, integer programming and combinatorial optimization, approximation algorithms with theoretical guarantees and approximation schemes, heuristics and meta-heuristics, ...
Added: July 7, 2022
Raayatpanah M. A., Khodayifar S., Weise T. et al., Journal of Combinatorial Optimization 2022 Vol. 44 No. 1 P. 242–268
In this paper, an extension of the minimum cost flow problem is considered in which multiple incommensurate weights are associated with each arc. In the minimum cost flow problem, flow is sent over the arcs of a graph from source nodes to sink nodes. The goal is to select a subgraph with minimum associated costs ...
Added: November 16, 2021
Switzerland: Springer, 2021.
This book constitutes the refereed proceedings of the 12th International Conference on Optimization and Applications, OPTIMA 2021, held in Petrovac, Montenegro, in September-October 2021.
The 22 full and 3 short papers presented were carefully reviewed and selected from 63 submissions. The papers are organized into the following topical sub-headings: mathematical programming, global optimization, discrete and combinatorial ...
Added: November 4, 2021