![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Zhaowei Miao
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j8]Ke Fu, Yanzhi Li
, Huiqiang Mao
, Zhaowei Miao:
Firms' production and green technology strategies: The role of emission asymmetry and carbon taxes. Eur. J. Oper. Res. 305(3): 1100-1112 (2023)
2010 – 2019
- 2018
- [j7]Zhaowei Miao, Huiqiang Mao, Ke Fu, Yu Wang:
Remanufacturing with trade-ins under carbon regulations. Comput. Oper. Res. 89: 253-268 (2018) - [c8]Yifan He, Pingping Wen, Yongquan Lan, Zhaowei Miao:
Hotel Cancellation Strategies Under Online Advanced Booking. IEEM 2018: 1632-1636 - 2014
- [j6]Dongsheng Xu, Cai Wen Zhang, Zhaowei Miao, Raymond K. Cheung:
A flow allocation strategy for routing over multiple flow classes with an application to air cargo terminals. Comput. Oper. Res. 51: 1-10 (2014) - [j5]Zhaowei Miao, Shun Cai, Di Xu:
Applying an adaptive tabu search algorithm to optimize truck-dock assignment in the crossdock management system. Expert Syst. Appl. 41(1): 16-22 (2014) - 2013
- [j4]Ke Fu, Zhaowei Miao, Jiayan Xu:
On Planar medianoid Competitive Location Problems with Manhattan Distance. Asia Pac. J. Oper. Res. 30(2) (2013) - [j3]Ke Fu, Jiayan Xu, Zhaowei Miao:
Newsvendor with multiple options of expediting. Eur. J. Oper. Res. 226(1): 94-99 (2013) - 2012
- [j2]Zhaowei Miao, Feng Yang, Ke Fu, Dongsheng Xu:
Transshipment service through crossdocks with both soft and hard time windows. Ann. Oper. Res. 192(1): 21-47 (2012)
2000 – 2009
- 2009
- [j1]Zhaowei Miao, Andrew Lim
, Hong Ma:
Truck dock assignment problem with operational time constraint within crossdocks. Eur. J. Oper. Res. 192(1): 105-115 (2009) - 2008
- [c7]Zhaowei Miao, Ke Fu, Qi Fei, Fan Wang
:
Meta-heuristic Algorithm for the Transshipment Problem with Fixed Transportation Schedules. IEA/AIE 2008: 601-610 - [c6]Fan Wang
, Ben Chen, Zhaowei Miao:
A Survey on Reviewer Assignment Problem. IEA/AIE 2008: 718-727 - 2006
- [c5]Fagui Liu, Zhaowei Miao:
The Application of RFID Technology in Production Control in the Discrete Manufacturing Industry. AVSS 2006: 68 - [c4]Andrew Lim
, Hong Ma, Zhaowei Miao:
Truck Dock Assignment Problem with Time Windows and Capacity Constraint in Transshipment Network Through Crossdocks. ICCSA (3) 2006: 688-697 - [c3]Andrew Lim
, Hong Ma, Zhaowei Miao:
Truck Dock Assignment Problem with Operational Time Constraint Within Crossdocks. IEA/AIE 2006: 262-271 - [c2]Xi Li, Andrew Lim
, Zhaowei Miao, Brian Rodrigues:
Reducing Transportation Costs in Distribution Networks. IEA/AIE 2006: 1138-1148 - 2004
- [c1]Andrew Lim, Zhaowei Miao, Brian Rodrigues, Zhou Xu:
Transshipment Through Crossdocks with Inventory and Time Windows. COCOON 2004: 122-131
Coauthor Index
![](https://dblp.uni-trier.de/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-24 23:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint