• A
  • A
  • A
  • АБВ
  • АБВ
  • АБВ
  • A
  • A
  • A
  • A
  • A
Обычная версия сайта
  • RU
  • EN
  • HSE University
  • Publications
  • Book chapter
  • Optimal Monomial Quadratization for ODE Systems
  • RU
  • EN
Расширенный поиск
Высшая школа экономики
Национальный исследовательский университет
Priority areas
  • business informatics
  • economics
  • engineering science
  • humanitarian
  • IT and mathematics
  • law
  • management
  • mathematics
  • sociology
  • state and public administration
by year
  • 2028
  • 2027
  • 2026
  • 2025
  • 2024
  • 2023
  • 2022
  • 2021
  • 2020
  • 2019
  • 2018
  • 2017
  • 2016
  • 2015
  • 2014
  • 2013
  • 2012
  • 2011
  • 2010
  • 2009
  • 2008
  • 2007
  • 2006
  • 2005
  • 2004
  • 2003
  • 2002
  • 2001
  • 2000
  • 1999
  • 1998
  • 1997
  • 1996
  • 1995
  • 1994
  • 1993
  • 1992
  • 1991
  • 1990
  • 1989
  • 1988
  • 1987
  • 1986
  • 1985
  • 1984
  • 1983
  • 1982
  • 1981
  • 1980
  • 1979
  • 1978
  • 1977
  • 1976
  • 1975
  • 1974
  • 1973
  • 1972
  • 1971
  • 1970
  • 1969
  • 1968
  • 1967
  • 1966
  • 1965
  • 1964
  • 1963
  • 1958
  • More
Subject
News
September 18, 2026
When Pictures Hinder Understanding: Illustrations May Impede Learning of Abstract Ideas
Illustrations can help remember specific actions but do not always make abstract ideas easier to learn. Researchers from HSE University and Humboldt University compared how people learn from texts with different levels of abstractness. They found that participants remembered illustrations better and performed better on related tasks after reading a multimedia text about yoga asanas than after reading an abstract text about the Nash equilibrium. The findings could help improve the selection of illustrations for educational and informational materials. The study has been published in Learning and Instruction.
September 17, 2026
'I Wish That People Would Place Greater Trust in Science'
When Tatiana Eremicheva chose Fundamental and Computational Linguistics as her field of study, she thought it would be about learning languages. Instead, she discovered it was about helping people. In this interview for the HSE Young Scientists project, she discusses science as a way of understanding the world, billiards as a team-building activity, and why learning to read is not always as easy as it seems.
September 15, 2026
Immunity to Chaos: How Personal Resources Help Us Cope with the Challenges of a Turbulent World
International conflicts, crises and digital overload—the modern world puts our minds to the test every day. Traditional psychology often focuses on the consequences: anxiety, depression, and psychosomatic disorders. But what if we looked at the problem differently—through the lens of the resources that prevent us from breaking down? Psychological immunity is precisely this set of resources. Alena Zolotareva and her group, Psychological Immunity as a Resource for Positive Functioning, are developing an integrative model of this phenomenon, adapting diagnostic tools and preparing for large-scale empirical research. Why do psychologists need to collaborate with medical professionals, and how could their research transform preventive care in clinics and corporations?

 

Have you spotted a typo?
Highlight it, click Ctrl+Enter and send us a message. Thank you for your help!

Publications
  • Books
  • Articles
  • Chapters of books
  • Working papers
  • Report a publication
  • Research at HSE

?

Optimal Monomial Quadratization for ODE Systems

P. 122–136.
Bychkov A., Pogudin G.
Language: English
DOI
Text on another site
Keywords: branch-and-boundDifferential equationsQuadratization
Publication based on the results of:
Mathematical methods in studies of algorithmic complexity and formal languages (2021)

In book

International Workshop on Combinatorial Algorithms, 32nd International Workshop, IWOCA 2021, Ottawa, ON, Canada, July 5–7, 2021
Vol. 12757. , Springer, 2021.
Similar publications
Transmutations, Singular and Fractional Differential Equations with Applications to Mathematical Physics
Shishkina E., Switzerland: Academic Press, 2020.
Transmutations, Singular and Fractional Differential Equations with Applications to Mathematical Physics connects difficult problems with similar more simple ones. The book's strategy works for differential and integral equations and systems and for many theoretical and applied problems in mathematics, mathematical physics, probability and statistics, applied computer science and numerical methods. In addition to being exposed ...
Added: March 7, 2026
Branch-and-Bound and Dynamic Programming Approaches for the Knapsack Problem
Burashnikov E., Operations Research Forum 2024
Added: September 21, 2024
Concurrently Employing Resources of Several Supercomputers With Parascip Solver By Everest Platform
Smirnov S., Voloshinov V., O.V. Sukhoroslov, , in: Proceedings of the 9th International Conference "Distributed Computing and Grid Technologies in Science and Education" (GRID'2021), Dubna, Russia, July 5-9, 2021.: CEUR Workshop Proceedings, 2021. P. 413–417.
ParaSCIP is rather advanced open-source solver for discrete and global optimization problems. This solver is distinguished by that it can run on distributed memory systems and use up to 80,000 cores, solving open problems from the MIPLIB test libraries. Earlier, using this solver, we confirmed the conjecture on optimal packing of nine congruent circles on ...
Added: October 30, 2022
On the interpretation of Dirac pulses in differential equations for phase oscillators
Klinshov V. V., Lücken L., Feketa P., Chaos 2021 Vol. 31 No. 3 Article 031102
In this note, we discuss the usage of the Dirac  function in models of phase oscillators with pulsatile inputs. Many authors use a product of the delta function and the phase response curve in the right-hand side of an ordinary differential equation to describe the discontinuous phase dynamics in such systems. We point out ...
Added: March 16, 2022
Differential Equations, Mathematical Physics, and Applications: Selim Grigorievich Krein Centennial
American Mathematical Society, 2019.
This is the second of two volumes dedicated to the centennial of the distinguished mathematician Selim Grigorievich Krein. Krein was a major contributor to functional analysis, operator theory, partial differential equations, fluid dynamics, and other areas, and the author of several influential monographs in these areas. He was a prolific teacher, graduating 83 Ph.D. students. Krein also created and ran, ...
Added: August 24, 2019
Vestnik St. Petersburg University: Mathematics
Allerton Press Inc., 2017.
This journal publishes the mathematics section of Series I of the Vestnik (Herald) of St. Petersburg University, and is one of the oldest Russian mathematics journals in English translation. Articles cover the major areas of pure and applied mathematics.  Many famous mathematicians are associated with the Faculty of Mathematics and Mechanics at St. Petersburg University, including ...
Added: February 4, 2019
On Domain Decomposition Strategies to Parallelize Branch-and-Bound Method for Global Optimization in Everest Distributed Environment
Smirnov Sergey, Voloshinov V., Procedia Computer Science 2018 Vol. 136 P. 128–135
Previous publications presented an implementation of coarse-grained parallel Branch-and-Bound (B&B) method. It supports two strategies: decomposition of feasible domain into a set of sub-problems; “multisearch” (or concurrent) solving the same problem with different settings of the BNB-method. In both cases several B&B-solver’s processes exchange best values of goal function on feasible solutions they found. Earlier, ...
Added: December 20, 2018
A branch-and-bound algorithm for the cell formation problem
Irina E. Utkina, Mikhail V. Batsyn, Ekaterina K. Batsyna, International Journal of Production Research 2018 Vol. 56 No. 9 P. 3262–3273
The Cell Formation Problem (CFP) is an important optimisation problem in manufacturing. It has been introduced in the Group Technology (GT) and its goal is to group machines and parts processed on them into production cells minimising the movement of parts to other cells for processing and maximising for each cell the loading of its ...
Added: March 11, 2018
An enhanced bitstring encoding for exact maximum clique search in sparse graphs
Pablo San Segundo ., Jorge Artieda .., Mikhail Batsyn et al., Optimization Methods and Software 2017 Vol. 32 No. 2 P. 312–335
This paper describes BBMCW, a new efficient exact maximum clique algorithm tailored for large sparse graphs which can be bit-encoded directly into memory without a heavy performance penalty. These graphs occur in real-life problems when some form of locality may be exploited to reduce their scale. One such example is correspondence graphs derived from data association ...
Added: March 9, 2017
Improved initial vertex ordering for exact maximum clique search
San Segundo P., Lopez A., Mikhail Batsyn et al., Applied Intelligence 2016 Vol. 45 No. 3 P. 868–880
This paper describes a new initial vertex ordering procedure NEW_SORT designed to enhance approximate-colour exact algorithms for the maximum clique problem (MCP). NEW_SORT considers two different vertex orderings: degree and colour-based. The degree-based vertex ordering describes an improvement over a well-known vertex ordering used by exact solvers. Moreover, colour-based vertex orderings for the MCP have ...
Added: May 27, 2016
ISS team scheduling problem
Alexander Lazarev, Gushchina V., , in: Optimization and applications (OPTIMA-2014).: M.: -, 2014. P. 123–124.
We consider the problem of planning the cousmonaut's time in ISS with given set of tasks, time planning horizon and load constraints. Shown that the problem is NP-hard in a strong sense. The heuristic algorithm was proposed. Proved that proposed algorithm is exact for problem with requirement of performing all tasks. Program C++ was written ...
Added: October 16, 2014
Tolerance-Based vs. Cost-Based Branching for the Asymmetric Capacitated Vehicle Routing Problem
Mikhail Batsyn, Boris Goldengorin, Anton Kocheturov et al., , in: Models, Algorithms, and Technologies for Network AnalysisVol. 59.: NY: Springer, 2013. Ch. 1 P. 1–10.
In this paper, we consider the asymmetric capacitated vehicle routing problem (ACVRP). We compare the search tree size and computational time for the bottleneck tolerance-based and cost-based branching rules within a branch-and-bound algorithm on the FTV benchmark instances. Our computational experiments show that the tolerance-based branching rule reduces the search tree size by 45 times ...
Added: September 21, 2013
Search on the enumeration tree in the multiprocessor job-shop problem
Lazarev A. A., Carballo L., Vakhania N. et al., , in: IFAC Proceedings Volumes 14th IFAC Symposium on Information Control Problems in Manufacturing, Bucharest, 23-25 May 2012.: Бухарест: IFAC Technical Committee, 2012. P. 381–386.
We present an approach based on a two-stage ltration of the set of feasible solutions for the multiprocessor job-shop scheduling problem. On the rst stage we use extensive dominance relations, whereas on the second stage we use lower bounds. We show that several lower bounds can eciently be obtained and implemented. ...
Added: February 12, 2013
  • About
  • About
  • Key Figures & Facts
  • Sustainability at HSE University
  • Faculties & Departments
  • International Partnerships
  • Faculty & Staff
  • HSE Buildings
  • HSE University for Persons with Disabilities
  • Public Enquiries
  • Studies
  • Admissions
  • Programme Catalogue
  • Undergraduate
  • Graduate
  • Exchange Programmes
  • Summer University
  • Summer Schools
  • Semester in Moscow
  • Business Internship
  • Research
  • International Laboratories
  • Research Centres
  • Research Projects
  • Monitoring Studies
  • Conferences & Seminars
  • Academic Jobs
  • Yasin (April) International Academic Conference on Economic and Social Development
  • Media & Resources
  • Publications by staff
  • HSE Journals
  • Publishing House
  • iq.hse.ru: commentary by HSE experts
  • Library
  • Economic & Social Data Archive
  • Video
  • HSE Repository of Socio-Economic Information
  • HSE1993–2026
  • Contacts
  • Copyright
  • Privacy Policy
  • Site Map
Edit