default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTatiana V. Tchemisova
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j12]Olga I. Kostyukova
, Tatiana V. Tchemisova:
An exact explicit dual for the linear copositive programming problem. Optim. Lett. 17(1): 107-120 (2023)- 2022
- [j11]Olga I. Kostyukova, Tatiana V. Tchemisova:
Regularization Algorithms for Linear Copositive Programming Problems: An Approach Based on the Concept of Immobile Indices. Algorithms 15(2): 59 (2022) - [j10]Sonia Cafieri, Tatiana V. Tchemisova, Gerhard-Wilhelm Weber:
Twenty years of EUROPT, the EURO working group on Continuous Optimization. EURO J. Comput. Optim. 10: 100039 (2022) - [j9]Olga I. Kostyukova, Tatiana V. Tchemisova:
On strong duality in linear copositive programming. J. Glob. Optim. 83(3): 457-480 (2022) - [j8]Olga I. Kostyukova, Tatiana V. Tchemisova:
Regularization algorithms for linear copositive problems. RAIRO Oper. Res. 56(3): 1353-1371 (2022) - 2020
- [j7]Olga I. Kostyukova, Tatiana V. Tchemisova:
Algorithmic determination of immobile indices in convex SIP problems with polyhedral index sets. INFOR Inf. Syst. Oper. Res. 58(2): 182-201 (2020)
2010 – 2019
- 2019
- [j6]Paula Carvalho, Sofia J. Pinheiro, Tatiana V. Tchemisova:
Special Issue dedicated to Workshop on Graph Spectra, Combinatorics and Optimization (WGSCO2018), Aveiro, Portugal, January 2018. Discret. Appl. Math. 269: 1 (2019) - [e1]Igor A. Bykadorov, Vitaly A. Strusevich, Tatiana V. Tchemisova:
Mathematical Optimization Theory and Operations Research - 18th International Conference, MOTOR 2019, Ekaterinburg, Russia, July 8-12, 2019, Revised Selected Papers. Communications in Computer and Information Science 1090, Springer 2019, ISBN 978-3-030-33393-5 [contents] - 2017
- [j5]Olga I. Kostyukova, Tatiana V. Tchemisova:
Optimality Conditions for Convex Semi-infinite Programming Problems with Finitely Representable Compact Index Sets. J. Optim. Theory Appl. 175(1): 76-103 (2017) - [j4]Olga I. Kostyukova, Tatiana V. Tchemisova, M. A. Kurdina:
A study of one class of NLP problems arising in parametric semi-infinite programming. Optim. Methods Softw. 32(6): 1218-1243 (2017) - 2011
- [j3]Isabel Martins, Tania Guedes, Paula Rama, João Ramos, Tatiana V. Tchemisova:
Modelling the problem of food distribution by the Portuguese food banks. Int. J. Math. Model. Numer. Optimisation 2(3): 313-341 (2011) - 2010
- [j2]Olga I. Kostyukova, Tatiana V. Tchemisova:
Sufficient optimality conditions for convex semi-infinite programming. Optim. Methods Softw. 25(2): 279-297 (2010)
2000 – 2009
- 2007
- [j1]Tatiana V. Tchemisova:
Rigidity of abnormal extrema in nonlinear programming problems with equality and inequality constraints. Eur. J. Oper. Res. 181(3): 1233-1242 (2007)
Coauthor Index
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.
last updated on 2024-10-07 22:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
