default search action
Qie He
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j13]Zeyang Wu
, Kameng Nip
A New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound Constraints. INFORMS J. Comput. 33(3): 1197-1212 (2021) - 2020
- [j12]Zeyang Wu, Qie He
Optimal Switching Sequence for Switched Linear Systems. SIAM J. Control. Optim. 58(2): 1183-1206 (2020)
2010 – 2019
- 2019
- [j11]Qie He
Branch-and-Cut-and-Price for the Vehicle Routing Problem with Time Windows and Convex Node Costs. Transp. Sci. 53(5): 1409-1426 (2019) - 2018
- [j10]Ricardo Fukasawa
A Joint Vehicle Routing and Speed Optimization Problem. INFORMS J. Comput. 30(4): 694-709 (2018) - [i2]Zeyang Wu, Qie He:
Optimal switching sequence for switched linear systems. CoRR abs/1805.04677 (2018) - 2016
- [j9]Qie He, Junfeng Zhu, David Dingli, Jasmine Foo, Kevin Leder:
Optimized Treatment Schedules for Chronic Myeloid Leukemia. PLoS Comput. Biol. 12(10) (2016) - [j8]Shabbir Ahmed
On the Computational Complexity of Minimum-Concave-Cost Flow in a Two-Dimensional Grid. SIAM J. Optim. 26(4): 2059-2079 (2016) - [j7]Ricardo Fukasawa
A Branch-Cut-and-Price Algorithm for the Energy Minimization Vehicle Routing Problem. Transp. Sci. 50(1): 23-34 (2016) - [i1]Shabbir Ahmed, Qie He, Shi Li, George L. Nemhauser:
On the computational complexity of minimum-concave-cost flow in a two-dimensional grid. CoRR abs/1602.08515 (2016) - 2015
- [j6]Qie He, Shabbir Ahmed
Minimum concave cost flow over a grid network. Math. Program. 150(1): 79-98 (2015) - 2012
- [j5]Qie He, Shabbir Ahmed
Sell or Hold: A simple two-stage stochastic combinatorial optimization problem. Oper. Res. Lett. 40(2): 69-73 (2012) - 2011
- [j4]Qie He, Shabbir Ahmed
A Probabilistic Comparison of Split and Type 1 Triangle Cuts for Two-Row Mixed-Integer Programs. SIAM J. Optim. 21(3): 617-632 (2011)
2000 – 2009
- 2008
- [c2]Fuzhuo Huang, Ling Wang, Qie He:
A hybrid Differential Evolution with double populations for constrained optimization. IEEE Congress on Evolutionary Computation 2008: 18-25 - [c1]Qie He, Ling Wang, Fuzhuo Huang:
Nonlinear constrained optimization by enhanced co-evolutionary PSO. IEEE Congress on Evolutionary Computation 2008: 83-89 - 2007
- [j3]Fuzhuo Huang, Ling Wang, Qie He:
An effective co-evolutionary differential evolution for constrained optimization. Appl. Math. Comput. 186(1): 340-356 (2007) - [j2]Qie He, Ling Wang:
A hybrid particle swarm optimization with a feasibility-based rule for constrained optimization. Appl. Math. Comput. 186(2): 1407-1422 (2007) - [j1]Qie He, Ling Wang:
An effective co-evolutionary particle swarm optimization for constrained engineering design problems. Eng. Appl. Artif. Intell. 20(1): 89-99 (2007)
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-10-07 21:19 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: