Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTao Wu 0004
Person information
- affiliation: Dow Chemical, Midland, MI, USA
- affiliation (former): University of Wisconsin-Madison, Department of Industrial and Systems Engineering, Madison, WI, USA
Other persons with the same name
- Tao Wu — disambiguation page
- Tao Wu 0001 — National University of Defense Technology, Institute of Automation, Changsha, China
- Tao Wu 0002
![[0000-0002-9859-4534]](https://dblp1.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-9859-4534")
— Yale University, Yale Stem Cell Center, New Haven, CT, USA (and 1 more) - Tao Wu 0003 — Chongqing University of Posts and Telecommunications, School of Cybersecurity and Information Law, China (and 1 more)
- Tao Wu 0005 — Hunan Normal University, Hunan Key Laboratory of Geospatial Big Data Mining and Application, Changsha, China (and 1 more)
- Tao Wu 0006 — TU Munich, Department of Computer Science, Germany (and 2 more)
- Tao Wu 0007 — China University of Geosciences, School of Automation, Wuhan, China (and 1 more)
- Tao Wu 0008 — Lingnan Normal University, School of Information Engineering, Zhanjiang, China (and 1 more)
- Tao Wu 0009 — University of Maryland, Center for Automation Research, UMIACS, College Park, MD, USA
- Tao Wu 0010 — Chengdu University of Information Technology, School of Computer Science, China
- Tao Wu 0011 — National University of Defense Technology, Hefei, China (and 2 more)
- Tao Wu 0012 — Southeast University, School of Mathematics, Nanjing, China (and 1 more)
- Tao Wu 0013 — University of Siegen, Germany
- Tao Wu 0014 — Northwestern Polytechnical University, School of Electronics and Information, China
- Tao Wu 0015 — Michigan State University, Electrical and Computer Engineering Department, East Lansing, MI, USA
- Tao Wu 0016 — South China Agricultural University, Zhujiang College, China
- Tao Wu 0017 — Xi'an Institute of Space Radio Technology, China (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j24]Tao Wu, Le Huang, Zhe Liang, Xiaoning Zhang, Canrong Zhang:
A supervised learning-driven heuristic for solving the facility location and production planning problem. Eur. J. Oper. Res. 301(2): 785-796 (2022)- [j23]Tao Wu:
Predictive Search for Capacitated Multi-Item Lot Sizing Problems. INFORMS J. Comput. 34(1): 385-406 (2022) - 2021
- [j22]Tao Wu, Zhongshun Shi, Canrong Zhang:
The hub location problem with market selection. Comput. Oper. Res. 127: 105136 (2021) - [j21]Canrong Zhang, Dandan Zhang, Tao Wu:
Data-driven branching and selection for lot-sizing and scheduling problems with sequence-dependent setups and setup carryover. Comput. Oper. Res. 132: 105289 (2021) - [j20]Zhongshun Shi, Hang Ma, Meiheng Ren, Tao Wu, Andrew Junfang Yu:
A learning-based two-stage optimization method for customer order scheduling. Comput. Oper. Res. 136: 105488 (2021) - [j19]Tao Wu:
Technical Note - On Nested Partitions Method for Global Optimization. Oper. Res. 69(5): 1533-1539 (2021) - 2020
- [j18]Tao Wu, Zhongshun Shi, Zhe Liang, Xiaoning Zhang, Canrong Zhang:
Dantzig-Wolfe decomposition for the facility location and production planning problem. Comput. Oper. Res. 124: 105068 (2020)
2010 – 2019
- 2019
- [j17]Mingyuan Wei, Mingyao Qi, Tao Wu, Canrong Zhang:
Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials. Eur. J. Oper. Res. 277(2): 521-541 (2019) - [j16]Fanrui Xie, Tao Wu, Canrong Zhang:
A Branch-and-Price Algorithm for the Integrated Berth Allocation and Quay Crane Assignment Problem. Transp. Sci. 53(5): 1427-1454 (2019) - 2018
- [j15]Canrong Zhang, Tao Wu, Mingyao Qi, Lixin Miao:
Simultaneous Allocation of Berths and Quay Cranes under Discrete Berth Situation. Asia Pac. J. Oper. Res. 35(3): 1850011:1-1850011:28 (2018) - [j14]Tao Wu, Fan Xiao, Canrong Zhang, Yan He, Zhe Liang:
The green capacitated multi-item lot sizing problem with parallel machines. Comput. Oper. Res. 98: 149-164 (2018) - [j13]Tao Wu, Zhe Liang, Canrong Zhang:
Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines. INFORMS J. Comput. 30(2): 236-258 (2018) - 2017
- [j12]Tao Wu, Kerem Akartunali, Raf Jans, Zhe Liang:
Progressive Selection Method for the Coupled Lot-Sizing and Cutting-Stock Problem. INFORMS J. Comput. 29(3): 523-543 (2017) - 2016
- [j11]Kerem Akartunali, Ioannis Fragkos, Andrew J. Miller, Tao Wu:
Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems. INFORMS J. Comput. 28(4): 766-780 (2016) - [j10]Defu Zhang, Leyuan Shi, Stephen C. H. Leung, Tao Wu:
A priority heuristic for the guillotine rectangular packing problem. Inf. Process. Lett. 116(1): 15-21 (2016) - 2014
- [j9]Canrong Zhang, Tao Wu, Ming Zhong, Li Zheng, Lixin Miao:
Location assignment for outbound containers with adjusted weight proportion. Comput. Oper. Res. 52: 84-93 (2014) - [j8]Canrong Zhang, Tao Wu, Kap Hwan Kim, Lixin Miao:
Conservative allocation models for outbound containers in container terminals. Eur. J. Oper. Res. 238(1): 155-165 (2014) - 2013
- [j7]Tao Wu, Canrong Zhang, Zhe Liang, Stephen C. H. Leung:
A Lagrangian relaxation-based method and models evaluation for multi-level lot sizing problems with backorders. Comput. Oper. Res. 40(7): 1852-1863 (2013) - [j6]Tao Wu, Kerem Akartunali, Jie Song, Leyuan Shi:
Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms. Discret. Event Dyn. Syst. 23(2): 211-239 (2013) - 2012
- [j5]Tao Wu, Leyuan Shi, Jie Song:
An MIP-based interval heuristic for the capacitated multi-level lot-sizing problem with setup times. Ann. Oper. Res. 196(1): 635-650 (2012) - [j4]Stephen C. H. Leung, Defu Zhang, Changle Zhou, Tao Wu:
A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem. Comput. Oper. Res. 39(1): 64-73 (2012) - [j3]Tao Wu, Leyuan Shi, Joseph Geunes, Kerem Akartunali:
On the equivalence of strong formulations for capacitated multi-level lot sizing problems with setup times. J. Glob. Optim. 53(4): 615-639 (2012) - [c5]Steven Hoerning, Jie Song, Tao Wu, Leyuan Shi:
Improving discrete event simulation in the emergency department with innovative and robust input analysis tools. CASE 2012: 131-136 - 2011
- [j2]Tao Wu, Leyuan Shi, Joseph Geunes, Kerem Akartunali:
An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging. Eur. J. Oper. Res. 214(2): 428-441 (2011) - [c4]Tao Wu, Leyuan Shi:
A lower and upper bound guided nested partitions method for solving capacitated multi-level production planning problems. CASE 2011: 78-83 - 2010
- [j1]Tao Wu, Leyuan Shi, Neil A. Duffie:
An HNP-MP Approach for the Capacitated Multi-Item Lot Sizing Problem With Setup Times. IEEE Trans Autom. Sci. Eng. 7(3): 500-511 (2010)
2000 – 2009
- 2009
- [c3]Tao Wu, Leyuan Shi:
A new heuristic method for capacitated multi-level lot sizing problem with backlogging. CASE 2009: 483-488 - [c2]Tao Wu, Leyuan Shi:
Hybrid nested Partitions And Relax-And-Fix approach for capacitated multi-item lot sizing problem. SOLI 2009: 359-364 - 2008
- [c1]Tao Wu, Leyuan Shi, Benjamin Quirt, Neil A. Duffie:
Integrated dynamic and simulation model on coupled closed-loop workstation capacity controls in a multi-workstation production system. WSC 2008: 1946-1951
Coauthor Index
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-06-27 23:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
