![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Le Thanh Tung
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j11]Le-Minh Nguyen, Le Thanh Tung
:
The second-stage moderating role of situational context on the relationships between eWOM and online purchase behaviour. Behav. Inf. Technol. 42(15): 2674-2687 (2023) - [j10]Le Thanh Tung
, Dang Hoang Tam:
Necessary and Sufficient Optimality Conditions for Fuzzy Variational Problems of Several Dependent Variables in Terms of Fuzzy Granular Derivatives. Int. J. Uncertain. Fuzziness Knowl. Based Syst. 31(5): 825-857 (2023) - [j9]Le Thanh Tung
, Pham Tien Thanh:
Exposure to risk communication, compliance with preventive measures and information-sharing behavior among students during the COVID-19 pandemic. Kybernetes 52(7): 2597-2615 (2023) - 2022
- [j8]Le Thanh Tung
:
Karush-Kuhn-Tucker optimality conditions and duality for multiobjective semi-infinite programming with vanishing constraints. Ann. Oper. Res. 311(2): 1307-1334 (2022) - [j7]Le Thanh Tung
, Dang Hoang Tam:
Optimality conditions and duality for continuous-time programming with multiple interval-valued objective functions. Comput. Appl. Math. 41(8) (2022) - 2021
- [j6]Le Thanh Tung:
On Second-Order Composed Proto-Differentiability of Proper Perturbation Maps in Parametric Vector Optimization Problems. Asia Pac. J. Oper. Res. 38(1): 2050040:1-2050040:24 (2021) - [i1]Le Thanh Tung, Pham Tuan Cuong:
Goal scoring in Premier League with Poisson regression. CoRR abs/2108.05796 (2021) - 2020
- [j5]Le Thanh Tung
:
Karush-Kuhn-Tucker optimality conditions and duality for convex semi-infinite programming with multiple interval-valued objective functions. J. Appl. Math. Comput. 62(1-2): 67-91 (2020)
2010 – 2019
- 2019
- [c1]Huy-Tien Nguyen
, Le Thanh Tung, Minh Le Nguyen:
Opinions Summarization: Aspect Similarity Recognition Relaxes The Constraint of Predefined Aspects. RANLP 2019: 487-496 - 2018
- [j4]Le Thanh Tung
:
Strong Karush-Kuhn-Tucker optimality conditions for multiobjective semi-infinite programming via tangential subdifferential. RAIRO Oper. Res. 52(4): 1019-1041 (2018) - 2014
- [j3]H. T. H. Diem, Phan Quoc Khanh
, Le Thanh Tung
:
On Higher-Order Sensitivity Analysis in Nonsmooth Vector Optimization. J. Optim. Theory Appl. 162(2): 463-488 (2014) - 2013
- [j2]Phan Quoc Khanh
, Le Thanh Tung:
First and second-order optimality conditions using approximations for vector equilibrium problems with constraints. J. Glob. Optim. 55(4): 901-920 (2013) - 2012
- [j1]Phan Quoc Khanh
, Le Thanh Tung
:
Local Uniqueness of Solutions to Ky Fan Vector Inequalities using Approximations as Derivatives. J. Optim. Theory Appl. 155(3): 840-854 (2012)
Coauthor Index
![](https://dblp.org/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.
last updated on 2024-04-25 05:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint