default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnton V. Ushakov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j9]Igor Vasilyev, Anton V. Ushakov
, Dong Zhang, Jie Ren:
Generalized multiple strip packing problem: Formulations, applications, and solution algorithms. Comput. Ind. Eng. 178: 109096 (2023)- 2021
- [j8]Anton V. Ushakov, Igor Vasilyev:
Near-optimal large-scale k-medoids clustering. Inf. Sci. 545: 344-362 (2021) - [c6]Tatiana V. Gruzdeva, Anton V. Ushakov:
K-Means Clustering via a Nonconvex Optimization Approach. MOTOR 2021: 462-476 - [c5]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 - 2020
- [c4]Anton V. Ushakov, Igor Vasilyev:
Locating Facilities Under Deliberate Disruptive Attacks. MOTOR 2020: 359-372
2010 – 2019
- 2019
- [j7]Adriano Masone, Claudio Sterle, Igor Vasilyev, Anton V. Ushakov:
A three-stage p-median based exact method for the optimal diversity management problem. Networks 74(2): 174-189 (2019) - [j6]Igor Vasilyev, Anton V. Ushakov, Nadezhda Maltugueva, Antonio Sforza:
An effective heuristic for large-scale fault-tolerant k-median problem. Soft Comput. 23(9): 2959-2967 (2019) - [c3]Anton V. Ushakov, Igor Vasilyev:
A parallel heuristic for a k-medoids clustering problem with unfixed number of clusters. MIPRO 2019: 1116-1120 - [c2]Anton V. Ushakov, Igor Vasilyev:
A Computational Comparison of Parallel and Distributed K-median Clustering Algorithms on Large-Scale Image Data. MOTOR (2) 2019: 119-130 - 2018
- [j5]Tatiana V. Gruzdeva, Anton V. Ushakov, Rentsen Enkhbat:
A biobjective DC programming approach to optimization of rougher flotation process. Comput. Chem. Eng. 108: 349-359 (2018) - [j4]Anton V. Ushakov, Xenia Klimentova, Igor Vasilyev:
Bi-level and Bi-objective p-Median Type Problems for Integrative Clustering: Application to Analysis of Cancer Gene-Expression and Drug-Response Data. IEEE ACM Trans. Comput. Biol. Bioinform. 15(1): 46-59 (2018) - 2016
- [c1]Xenia Klimentova, Anton V. Ushakov, Igor Vasilyev:
The p-median Problem with Order for Two-Source Clustering. DOOR (Supplement) 2016: 536-544 - 2015
- [j3]Emilio Carrizosa, Anton V. Ushakov, Igor Vasilyev:
Threshold robustness in discrete facility location problems: a bi-objective approach. Optim. Lett. 9(7): 1297-1314 (2015) - 2012
- [j2]Emilio Carrizosa, Anton V. Ushakov, Igor Vasilyev:
A computational study of a nonlinear minsum facility location problem. Comput. Oper. Res. 39(11): 2625-2633 (2012) - 2011
- [j1]Saïd Hanafi, Claudio Sterle, Anton V. Ushakov, Igor Vasilyev:
A parallel subgradient algorithm for Lagrangean dual function of the p-median problem. Stud. Inform. Univ. 9(3): 105-124 (2011)
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-04-25 05:50 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:
