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 33 matches
- 2021
- Barbara M. Anthony, Ananya D. Christman, Christine Chung, David S. Yuen:
Serving Rides of Equal Importance for Time-Limited Dial-a-Ride. MOTOR 2021: 35-50 - Konstantin Barkalov, Victor Gergel, Vladimir A. Grishagin, Evgeniy Kozinov:
An Approach for Simultaneous Finding of Multiple Efficient Decisions in Multi-objective Optimization Problems. MOTOR 2021: 127-143 - Vanya Barseghyan, Svetlana Solodusha:
Optimal Boundary Control of String Vibrations with Given Shape of Deflection at a Certain Moment of Time. MOTOR 2021: 299-313 - Vladimir B. Berikov, Alexander Litvinenko:
Weakly Supervised Regression Using Manifold Regularization and Low-Rank Matrix Representation. MOTOR 2021: 447-461 - Aleksandr Beznosikov, Vasilii Novitskii, Alexander V. Gasnikov:
One-Point Gradient-Free Methods for Smooth and Non-smooth Saddle-Point Problems. MOTOR 2021: 144-158 - Pavel A. Borisovsky, Anton V. Eremeev, Yulia V. Kovalenko, Lidia A. Zaozerskaya:
Rig Routing with Possible Returns and Stochastic Drilling Times. MOTOR 2021: 51-66 - Igor A. Bykadorov:
Dixit-Stiglitz-Krugman Model with Investments in R&D. MOTOR 2021: 397-409 - Ilya Chernykh:
Two-Machine Routing Open Shop: How Long Is the Optimal Makespan? MOTOR 2021: 253-266 - Edward Kh. Gimadi, Aleksandr S. Shevyakov, Alexandr A. Shtepa:
On Asymptotically Optimal Approach for the Problem of Finding Several Edge-Disjoint Spanning Trees of Given Diameter in an Undirected Graph with Random Edge Weights. MOTOR 2021: 67-78 - Dmitriy V. Gribanov:
An FPTAS for the Δ-Modular Multidimensional Knapsack Problem. MOTOR 2021: 79-95 - Tatiana V. Gruzdeva, Anton V. Ushakov:
K-Means Clustering via a Nonconvex Optimization Approach. MOTOR 2021: 462-476 - Sergey V. Ivanov, Aleksei N. Ignatov:
Sample Approximations of Bilevel Stochastic Programming Problems with Probabilistic and Quantile Criteria. MOTOR 2021: 221-234 - Igor' V. Izmest'ev, Viktor I. Ukhobotov:
A Discrete Game Problem with a Non-convex Terminal Set and a Possible Breakdown in Dynamics. MOTOR 2021: 314-325 - Alexander V. Kononov, Yulia V. Kovalenko:
Minimizing Total Completion Time in Multiprocessor Job Systems with Energy Constraint. MOTOR 2021: 267-279 - Vladimir N. Krutikov, Vladimir V. Meshechkin, Elena S. Kagan, Lev A. Kazakovtsev:
Machine Learning Algorithms of Relaxation Subgradient Method with Space Extension. MOTOR 2021: 477-492 - Alexander Y. Krylatov:
Equilibrium Traffic Flow Assignment in a Multi-subnet Urban Road Network. MOTOR 2021: 3-16 - Valeriy M. Marakulin:
On Contractual Approach for Non-convex Production Economies. MOTOR 2021: 410-429 - Vladislav Matyukhin, Sergey Igorevich Kabanikhin, Maxim A. Shishlenin, Nikita S. Novikov, Artem Vasin, Alexander V. Gasnikov:
Convex Optimization with Inexact Gradients in Hilbert Space and Applications to Elliptic Inverse Problems. MOTOR 2021: 159-175 - Vladimir V. Mazalov, Elena M. Parilina, Jiangjing Zhou:
Altruistic-Like Equilibrium in a Differential Game of Renewable Resource Extraction. MOTOR 2021: 326-339 - Andrey V. Orlov:
On Solving Bilevel Optimization Problems with a Nonconvex Lower Level: The Case of a Bimatrix Game. MOTOR 2021: 235-249 - Dmitry Pasechnyuk, Vladislav Matyukhin:
On the Computational Efficiency of Catalyst Accelerated Coordinate Descent. MOTOR 2021: 176-191 - Alexey Ratushnyi, Yury Kochetov:
A Column Generation Based Heuristic for a Temporal Bin Packing Problem. MOTOR 2021: 96-110 - Anna N. Rettieva:
Multicriteria Dynamic Games with Random Horizon. MOTOR 2021: 340-355 - Alexander A. Semenov, Ilya V. Otpuschennikov, Kirill Antonov:
On Some Variants of the Merging Variables Based (1+1)-Evolutionary Algorithm with Application to MaxSAT Problem. MOTOR 2021: 111-124 - Sergei P. Sidorov, Kirill Spiridinov:
Duality Gap Estimates for a Class of Greedy Optimization Algorithms in Banach Spaces. MOTOR 2021: 192-205 - Maxim V. Staritsyn, Nikolay Pogodaev, Elena V. Goncharova:
Feedback Maximum Principle for a Class of Linear Continuity Equations Inspired by Optimal Impulsive Control. MOTOR 2021: 356-368 - Petro Stetsyuk, Andreas Fischer, Oksana Pichugina:
A Penalty Approach to Linear Programs with Many Two-Sided Constraints. MOTOR 2021: 206-217 - Alexander S. Strekalovsky:
A Local Search Scheme for the Inequality-Constrained Optimal Control Problem. MOTOR 2021: 17-31 - Dmitry Trunin:
Nonlocal Optimization Methods for Quadratic Control Systems with Terminal Constraints. MOTOR 2021: 369-378 - Alexander Vasin, Olesya Grigoryeva:
Optimization of Regulation and Infrastructure of the Electricity Market. MOTOR 2021: 430-444
skipping 3 more matches
loading more results
failed to load more results, please try again later
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-12-22 16:55 CET 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