Остановите войну!
for scientists:
default search action
Sergei Chubanov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c1]Sergei Chubanov:
On the Complexity of PAC Learning in Hilbert Spaces. AAAI 2023: 7202-7209 - [i1]Sergei Chubanov:
On the complexity of PAC learning in Hilbert spaces. CoRR abs/2303.02047 (2023) - 2021
- [j12]Sergei Chubanov:
A scaling algorithm for optimizing arbitrary functions over vertices of polytopes. Math. Program. 190(1): 89-102 (2021) - [j11]Sergei Chubanov:
Correction to: A scaling algorithm for optimizing arbitrary functions over vertices of polytopes. Math. Program. 190(1): 103-104 (2021) - [j10]Sergei Chubanov:
A Generalized Simplex Method for Integer Problems Given by Verification Oracles. SIAM J. Optim. 31(1): 686-701 (2021) - [j9]Sergei Chubanov:
Method of Alternating Contractions and Its Applications to Some Convex Optimization Problems. SIAM J. Optim. 31(3): 1947-1970 (2021) - 2020
- [j8]Sergei Chubanov:
A polynomial algorithm for convex quadratic optimization subject to linear inequalities. Discret. Appl. Math. 275: 19-28 (2020)
2010 – 2019
- 2016
- [j7]Sergei Chubanov:
A Polynomial-Time Descent Method for Separable Convex Optimization Problems with Linear Constraints. SIAM J. Optim. 26(1): 856-889 (2016) - 2015
- [j6]Sergei Chubanov:
A polynomial projection algorithm for linear feasibility problems. Math. Program. 153(2): 687-713 (2015) - 2012
- [j5]Sergei Chubanov:
A strongly polynomial algorithm for linear systems having a binary solution. Math. Program. 134(2): 533-570 (2012) - [j4]Sergei Chubanov, Erwin Pesch:
An FPTAS for the single-item capacitated economic lot-sizing problem with supply and demand. Oper. Res. Lett. 40(6): 445-449 (2012)
2000 – 2009
- 2009
- [j3]Sergei Chubanov, Erwin Pesch:
Recursive functions on the plane and FPTASs for production planning and scheduling problems with two facilities. Math. Methods Oper. Res. 70(2): 313-335 (2009) - 2008
- [j2]Sergei Chubanov, Mikhail Y. Kovalyov, Erwin Pesch:
A single-item economic lot-sizing problem with a non-uniform resource: Approximation. Eur. J. Oper. Res. 189(3): 877-889 (2008) - 2006
- [b1]Sergei Chubanov:
Sensitivity analysis and efficient algorithms for some economic lot-sizing and scheduling problems. Siegen University, Germany, 2006 - [j1]Sergei Chubanov, Mikhail Y. Kovalyov, Erwin Pesch:
An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure. Math. Program. 106(3): 453-466 (2006)
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-02-16 17:22 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint