![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 26 matches
- 2021
- Alla F. Albu
, Vladimir I. Zubov
:
Application of Second-Order Optimization Methods to Solving the Inverse Coefficient Problems. OPTIMA 2021: 351-364 - Anatoly S. Antipin
, Elena V. Khoroshilova
:
Optimal Control of Two Linear Programming Problems. OPTIMA 2021: 151-164 - Maria V. Barkova
, Alexander S. Strekalovsky
:
Computational Study of Local Search Methods for a D.C. Optimization Problem with Inequality Constraints. OPTIMA 2021: 94-109 - Levon A. Beklaryan, Armen L. Beklaryan
:
Existence of Bounded Soliton Solutions for a Finite Difference Analogue of the Wave Equation with a Nonlinear Potential of General Form. OPTIMA 2021: 165-175 - Aleksandr Beznosikov
, Alexander Rogozin, Dmitry Kovalev
, Alexander V. Gasnikov:
Near-Optimal Decentralized Algorithms for Saddle Point Problems over Time-Varying Networks. OPTIMA 2021: 246-257 - Seilkhan Boranbayev
, Nataliia Obrosova
, Alexander Shananin
:
Production Network Centrality in Connection to Economic Development by the Case of Kazakhstan Statistics. OPTIMA 2021: 321-335 - Pavel A. Borisovsky
, Olga Battaïa
:
MIP-Based Heuristics for a Robust Transfer Lines Balancing Problem. OPTIMA 2021: 123-135 - Igor A. Bykadorov
:
Equilibrium in the Piece-Wise Constant Pricing. OPTIMA 2021: 288-302 - Yuri Evtushenko
, Vlasta Malkova
, Alexey Tret'yakov
:
Exit from Singularity. New Optimization Methods and the p-Regularity Theory Applications. OPTIMA 2021: 3-19 - Alexey Generalov
, Lev Rapoport
, Mikhail Yu. Shavin
:
Attraction Domains in the Control Problem of a Wheeled Robot Following a Curvilinear Path over an Uneven Surface. OPTIMA 2021: 176-190 - Victor Gorelik
, Tatiana Zolotova
:
Stackelberg and Nash Equilibria in Games with Linear-Quadratic Payoff Functions as Models of Public Goods. OPTIMA 2021: 275-287 - Tatiana V. Gruzdeva
, Oleg V. Khamisov:
On Search for All Roots of a System of Quadratic Equations. OPTIMA 2021: 110-120 - Tatiana V. Gruzdeva
, Anton V. Ushakov
:
A Computational Study of the DC Minimization Global Optimality Conditions Applied to K-Means Clustering. OPTIMA 2021: 79-93 - Andrei Ignatov
, Mikhail Posypkin
:
Techniques for Speeding up H-Core Protein Fitting. OPTIMA 2021: 336-350 - Anastasiya Ivanova, Dmitry Pasechnyuk, Dmitry Grishchenko, Egor Shulgin, Alexander V. Gasnikov, Vladislav Matyukhin:
Adaptive Catalyst for Smooth Convex Optimization. OPTIMA 2021: 20-37 - Igor E. Kaporin
:
A Derivative-Free Nonlinear Least Squares Solver. OPTIMA 2021: 217-230 - Michael Yu. Khachay
, Stanislav Ukolov
, Alexander Petunin
:
Problem-Specific Branch-and-Bound Algorithms for the Precedence Constrained Generalized Traveling Salesman Problem. OPTIMA 2021: 136-148 - Vladimir I. Khandeev
, Sergey Neshchadim
:
Max-Min Problems of Searching for Two Disjoint Subsets. OPTIMA 2021: 231-245 - L. I. Minchenko, S. I. Sirotko:
On Local Error Bound in Nonlinear Programs. OPTIMA 2021: 38-49 - Yury Nikulin
, Vladimir A. Emelichev:
Analyzing Stability of Extreme Portfolios. OPTIMA 2021: 303-317 - Evgeni A. Nurminskii
, Natalia B. Shamray
:
Row-Oriented Decomposition in Large-Scale Linear Optimization. OPTIMA 2021: 50-63 - Alexander Pesterev
, Yury Morozov
:
Optimizing Coefficients of a Controller in the Point Stabilization Problem for a Robot-Wheel. OPTIMA 2021: 191-202 - Alexander Rogozin, Vladislav Lukoshkin, Alexander V. Gasnikov, Dmitry Kovalev
, Egor Shulgin:
Towards Accelerated Rates for Distributed Optimization over Time-Varying Networks. OPTIMA 2021: 258-272 - Pavel Sorokovikov, Alexander Gornov, Alexander Strelnikov:
Algorithm for the Numerical Solution of Optimal Control Problems in Robotic Systems. OPTIMA 2021: 203-214 - Vitaly Zhadan
:
The Variant of Primal Simplex-Type Method for Linear Second-Order Cone Programming. OPTIMA 2021: 64-75 - Nicholas N. Olenev
, Yuri G. Evtushenko
, Milojica Jacimovic
, Michael Yu. Khachay
, Vlasta Malkova
:
Optimization and Applications - 12th International Conference, OPTIMA 2021, Petrovac, Montenegro, September 27 - October 1, 2021, Proceedings. Lecture Notes in Computer Science 13078, Springer 2021, ISBN 978-3-030-91058-7 [contents]
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-08-22 07:37 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint