Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Yuanxing Zhang

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 Linru Jiang

> Home > Persons > Yuanxing Zhang

Publications

2019
[j4]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/algorithms/ZhangZLJYZDH19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithms/ZhangZLJYZDH19
Jing Zhang, Xiangpeng Zhan, Taoyong Li, Linru Jiang, Jun Yang, Yuanxing Zhang, Xiaohong Diao, Sining Han:
A Convex Optimization Algorithm for Electricity Pricing of Charging Stations. Algorithms 12(10): 208 (2019)
2018
[c9]
- view
  authority control:
- export record
  dblp key:
  - conf/iecon/ZhangZLJLYM18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iecon/ZhangZLJLYM18
Jing Zhang, Yuanxing Zhang, Taoyong Li, Linru Jiang, Kang Li, He Yin, Chengbin Ma:
A Hierarchical Distributed Energy Management for Multiple PV-Based EV Charging Stations. IECON 2018: 1603-1608
[c8]
- view
  authority control:
- export record
  dblp key:
  - conf/iecon/LiZZJLYM18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iecon/LiZZJLYM18
Taoyong Li, Jing Zhang, Yuanxing Zhang, Linru Jiang, Bin Li, Dongxiang Yan, Chengbin Ma:
An Optimal Design and Analysis of a Hybrid Power Charging Station for Electric Vehicles Considering Uncertainties. IECON 2018: 5147-5152

a service of

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.