Zheng Yan 0003

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Qing Xia 0001

> Home > Persons > Zheng Yan 0003

Publications

2023
[j16]
- view
  authority control:
- export record
  dblp key:
  - journals/tsg/TanYXW23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tsg/TanYXW23
Zhenfei Tan, Zheng Yan, Qing Xia, Yang Wang:
Data-Driven Inverse Optimization for Modeling Intertemporally Responsive Loads. IEEE Trans. Smart Grid 14(5): 4129-4132 (2023)
[i7]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2302-13278
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2302-13278
Zhenfei Tan, Zheng Yan, Haiwang Zhong, Qing Xia:
Non-Iterative Solution for Coordinated Optimal Dispatch via Equivalent Projection-Part I: Theory. CoRR abs/2302.13278 (2023)
[i6]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2302-13280
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2302-13280
Zhenfei Tan, Zheng Yan, Haiwang Zhong, Qing Xia:
Non-Iterative Solution for Coordinated Optimal Dispatch via Equivalent Projection-Part II: Method and Applications. CoRR abs/2302.13280 (2023)

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.