Longcheng Liu

Publication Activity (10 Years)

Years Active: 2006-2024
Publications (10 Years): 17

Top Topics

Approximation Algorithms

Top Venues

J. Comb. Optim.

Theor. Comput. Sci.

Int. J. Pattern Recognit. Artif. Intell.

Publications

Mengting Ye, Zhenxue Chen, Yixin Guo, Kaili Yu, Longcheng Liu, Q. M. Jonathan Wu
BNDCNet: Bilateral nonlocal decoupled convergence network for semantic segmentation. J. Vis. Commun. Image Represent. 98 (2024)
Mengting Ye, Kaili Yu, Zhenxue Chen, Yixin Guo, Longcheng Liu
OIPNet: Multimodal Network with Orthogonal Information Processing for Semantic Segmentation in Indoor Scenes. Int. J. Pattern Recognit. Artif. Intell. 37 (16) (2023)
Yong Chen, Randy Goebel, Guohui Lin, Longcheng Liu, Bing Su, Weitian Tong, Yao Xu, An Zhang
A local search 4/3-approximation algorithm for the minimum 3-path partition problem. J. Comb. Optim. 44 (5) (2022)
Yong Chen, Yinhui Cai, Longcheng Liu, Guangting Chen, Randy Goebel, Guohui Lin, Bing Su, An Zhang
Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph. J. Comb. Optim. 43 (3) (2022)
Xiaolei Bian, Zhongbao Wei, Jiangtao He, Fengjun Yan, Longcheng Liu
A Novel Model-Based Voltage Construction Method for Robust State-of-Health Estimation of Lithium-Ion Batteries. IEEE Trans. Ind. Electron. 68 (12) (2021)
Yong Jiang, Weifeng Lin, Longcheng Liu, Anzhen Peng
Constrained inverse minimum flow problems under the weighted Hamming distance. Theor. Comput. Sci. 883 (2021)
Anzhen Peng, Longcheng Liu, Weifeng Lin
Improved approximation algorithms for two-stage flexible flow shop scheduling. J. Comb. Optim. 41 (1) (2021)
Longcheng Liu, Yong Chen, Jianming Dong, Randy Goebel, Guohui Lin, Yue Luo, Guanqun Ni, Bing Su, Yao Xu, An Zhang
Approximation algorithms for the three-machine proportionate mixed shop scheduling. Theor. Comput. Sci. 803 (2020)
Yong Chen, Randy Goebel, Guohui Lin, Longcheng Liu, Bing Su, Weitian Tong, Yao Xu, An Zhang
A Local Search 4/3-approximation Algorithm for the Minimum 3-path Partition Problem. FAW (2019)
Yinhui Cai, Guangting Chen, Yong Chen, Randy Goebel, Guohui Lin, Longcheng Liu, An Zhang
Approximation Algorithms for Two-Machine Flow-Shop Scheduling with a Conflict Graph. COCOON (2018)
Yinhui Cai, Guangting Chen, Yong Chen, Randy Goebel, Guohui Lin, Longcheng Liu, An Zhang
Approximation algorithms for two-machine flow-shop scheduling with a conflict graph. CoRR (2018)
Longcheng Liu, Yong Chen, Jianming Dong, Randy Goebel, Guohui Lin, Yue Luo, Guanqun Ni, Bing Su, An Zhang
Approximation algorithms for the three-machine proportionate mixed shop scheduling. CoRR (2018)
Yong Chen, Randy Goebel, Guohui Lin, Longcheng Liu, Bing Su, Weitian Tong, Yao Xu, An Zhang
A local search 4/3-approximation algorithm for the minimum 3-path partition problem. CoRR (2018)
Longcheng Liu, Guanqun Ni, Yong Chen, Randy Goebel, Yue Luo, An Zhang, Guohui Lin
Approximation Algorithms and a Hardness Result for the Three-Machine Proportionate Mixed Shop. AAIM (2018)
Longcheng Liu, Wenhao Zheng, Chao Li
Inverse minimum flow problem under the weighted sum-type Hamming distance. Discret. Appl. Math. 229 (2017)
Longcheng Liu, Enyu Yao
Capacity inverse minimum cost flow problems under the weighted Hamming distance. Optim. Lett. 10 (6) (2016)
Longcheng Liu, Yu'an Chen, Wenhao Zheng, Deqing Wang
Inverse Multicast Quality of Service Routing Problem with Bandwidth and Delay Under the Weighted l_1 Norm. TRIDENTCOM (2016)
Yiwei Jiang, Jueliang Hu, Longcheng Liu, Yuqing Zhu, T. C. E. Cheng
Competitive ratios for preemptive and non-preemptive online scheduling with nondecreasing concave machine cost. Inf. Sci. 269 (2014)
Longcheng Liu
Inverse Maximum Flow Problems under the Combining Norms. FAW-AAIM (2013)
Biao Wu, Longcheng Liu, Enyu Yao
Minimizing the maximum bump cost in linear extensions of a poset. J. Comb. Optim. 26 (3) (2013)
Longcheng Liu, Enyu Yao
Weighted inverse maximum perfect matching problems under the Hamming distance. J. Glob. Optim. 55 (3) (2013)
Longcheng Liu, Yong Chen, Biao Wu, Enyu Yao
Weighted Inverse Minimum Cut Problem under the Sum-Type Hamming Distance. FAW-AAIM (2012)
Longcheng Liu, Biao Wu, Enyu Yao
Minimizing the sum cost in linear extensions of a poset. J. Comb. Optim. 21 (2) (2011)
Yiwei Jiang, Longcheng Liu, Biao Wu, Enyu Yao
Inverse minimum cost flow problems under the weighted Hamming distance. Eur. J. Oper. Res. 207 (1) (2010)
Biao Wu, Enyu Yao, Longcheng Liu
A polynomially solvable case of optimal linear extension problem of a poset. J. Comb. Optim. 20 (4) (2010)
Longcheng Liu, Qin Wang
Constrained inverse min-max spanning tree problems under the weighted Hamming distance. J. Glob. Optim. 43 (1) (2009)
Longcheng Liu, Enyu Yao
Inverse min-max spanning tree problem under the Weighted sum-type Hamming distance. Theor. Comput. Sci. 396 (1-3) (2008)
Longcheng Liu, Enyu Yao
Inverse Min-Max Spanning Tree Problem Under the Weighted Sum-Type Hamming Distance. ESCAPE (2007)
Longcheng Liu, Enyu Yao
A Weighted Inverse Minimum Cut Problem under the Bottleneck Type Hamming Distance. Asia Pac. J. Oper. Res. 24 (5) (2007)
Longcheng Liu, Jianzhong Zhang
Inverse maximum flow problems under the weighted Hamming distance. J. Comb. Optim. 12 (4) (2006)