default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBo Peng 0010
Person information
- affiliation: Southwestern University of Finance and Economics, Faculty of Business Administration, Chengdu, China
- affiliation: Huazhong University of Science and Technology, School of Computer Science and Technology, Wuhan, China
Other persons with the same name
- Bo Peng — disambiguation page
- Bo Peng 0001
![[0000-0001-8225-2284]](https://dblp.org/img/orcid-mark.12x12.png "0000-0001-8225-2284")
— University of Texas, Department of Genetics, Houston, TX, USA - Bo Peng 0002 — Chinese Academy of Sciences, National Laboratory of Pattern Recognition, Beijing, China
- Bo Peng 0003 — University of Leeds, School of Electronic and Electrical Engineering, UK
- Peng Bo 0001 (aka: Bo Peng 0004) — Beihang University, School of Electronic and Information Engineering, Beijing, China
- Bo Peng 0005 — Arizona State University, Tempe, USA
- Bo Peng 0006 — Southwest Jiaotong University, Institute of Artificial Intelligence, School of Information Science and Technology, Chengdu, China
- Bo Peng 0007 — School of Electrical and Information Engineering, Tianjin University, Tianjin, China
- Bo Peng 0008 — Chinese Academy of Sciences, Suzhou Institute of Biomedical Engineering and Technology, China
- Bo Peng 0009 — Ohio State University, Department of Computer Science and Engineering, Columbus, OH, USA
- Bo Peng 0011 — Indiana University, School of Informatics and Computing, Bloomington, IN, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Bo Peng, Lunwen Wu, Rafael Martí, Jiangshui Ma:
A fast path relinking algorithm for the min-max edge crossing problem. Comput. Oper. Res. 166: 106603 (2024)- [j13]Bo Peng, Songge Wang, Donghao Liu, Zhouxing Su, Zhipeng Lü, Fred W. Glover:
Solving the incremental graph drawing problem by multiple neighborhood solution-based tabu search algorithm. Expert Syst. Appl. 237(Part B): 121477 (2024) - 2023
- [j12]Yang Wang, Haichao Liu, Bo Peng, Haibo Wang, Abraham P. Punnen:
A three-phase matheuristic algorithm for the multi-day task assignment problem. Comput. Oper. Res. 159: 106313 (2023) - 2021
- [j11]Bo Peng, Lifan Wu, Yang Wang, Qinghua Wu:
Solving maximum quasi-clique problem by a hybrid artificial bee colony approach. Inf. Sci. 578: 214-235 (2021) - 2020
- [j10]Bo Peng, Yuan Zhang, Zhipeng Lü, T. C. E. Cheng, Fred W. Glover:
A learning-based memetic algorithm for the multiple vehicle pickup and delivery problem with LIFO loading. Comput. Ind. Eng. 142: 106241 (2020) - [j9]Bo Peng, Donghao Liu, Zhipeng Lü, Rafael Martí, Junwen Ding:
Adaptive memory programming for the dynamic bipartite drawing problem. Inf. Sci. 517: 183-197 (2020) - [j8]Bo Peng, Yuan Zhang, T. C. E. Cheng, Zhipeng Lü, Abraham P. Punnen:
A two-individual based path-relinking algorithm for the satellite broadcast scheduling problem. Knowl. Based Syst. 196: 105774 (2020)
2010 – 2019
- 2019
- [j7]Junwen Ding, Liji Shen, Zhipeng Lü, Bo Peng:
Parallel machine scheduling with completion-time-based criteria and sequence-dependent deterioration. Comput. Oper. Res. 103: 35-45 (2019) - [j6]Yongliang Lu, Una Benlic, Qinghua Wu, Bo Peng:
Memetic algorithm for the multiple traveling repairman problem with profits. Eng. Appl. Artif. Intell. 80: 35-47 (2019) - 2016
- [j5]T. C. E. Cheng, Bo Peng, Zhipeng Lü:
A hybrid evolutionary algorithm to solve the job shop scheduling problem. Ann. Oper. Res. 242(2): 223-237 (2016) - [j4]Bo Peng, Mengqi Liu, Zhipeng Lü, Gary A. Kochenberger, Haibo Wang:
An ejection chain approach for the quadratic multiple knapsack problem. Eur. J. Oper. Res. 253(2): 328-336 (2016) - [j3]Taoqing Zhou, Zhipeng Lü, Yang Wang, Junwen Ding, Bo Peng:
Multi-start iterated tabu search for the minimum weight vertex cover problem. J. Comb. Optim. 32(2): 368-384 (2016) - 2015
- [j2]Bo Peng, Zhipeng Lü, T. C. E. Cheng:
A tabu search/path relinking algorithm to solve the job shop scheduling problem. Comput. Oper. Res. 53: 154-164 (2015) - [j1]Tao Qin, Bo Peng, Una Benlic, T. C. E. Cheng, Yang Wang, Zhipeng Lü:
Iterated local search based on multi-type perturbation for single-machine earliness/tardiness scheduling. Comput. Oper. Res. 61: 81-88 (2015) - 2014
- [i1]Bo Peng, Zhipeng Lü, T. C. E. Cheng:
A Tabu Search/Path Relinking Algorithm to Solve the Job Shop Scheduling Problem. CoRR abs/1402.5613 (2014)
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-11-08 20:33 CET 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:
