Longcheng Liu

According to our database, Longcheng Liu authored at least 26 papers between 2006 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

BNDCNet: Bilateral nonlocal decoupled convergence network for semantic segmentation.

Mengting Ye, Zhenxue Chen, Yixin Guo, Kaili Yu, Longcheng Liu, Q. M. Jonathan Wu

J. Vis. Commun. Image Represent., 2024

2023

OIPNet: Multimodal Network with Orthogonal Information Processing for Semantic Segmentation in Indoor Scenes.

Mengting Ye, Kaili Yu, Zhenxue Chen, Yixin Guo, Longcheng Liu

Int. J. Pattern Recognit. Artif. Intell., December, 2023

2022

A local search 4/3-approximation algorithm for the minimum 3-path partition problem.

Yong Chen, Randy Goebel, Guohui Lin, Longcheng Liu, Bing Su, Weitian Tong, Yao Xu, An Zhang

J. Comb. Optim., 2022

Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph.

Yong Chen, Yinhui Cai, Longcheng Liu, Guangting Chen, Randy Goebel, Guohui Lin, Bing Su, An Zhang

J. Comb. Optim., 2022

2021

A Novel Model-Based Voltage Construction Method for Robust State-of-Health Estimation of Lithium-Ion Batteries.

Xiaolei Bian, Zhongbao Wei, Jiangtao He, Fengjun Yan, Longcheng Liu

IEEE Trans. Ind. Electron., 2021

Constrained inverse minimum flow problems under the weighted Hamming distance.

Yong Jiang, Weifeng Lin, Longcheng Liu, Anzhen Peng

Theor. Comput. Sci., 2021

Improved approximation algorithms for two-stage flexible flow shop scheduling.

Anzhen Peng, Longcheng Liu, Weifeng Lin

J. Comb. Optim., 2021

2020

Approximation algorithms for the three-machine proportionate mixed shop scheduling.

Longcheng Liu, Yong Chen, Jianming Dong, Randy Goebel, Guohui Lin, Yue Luo, Guanqun Ni, Bing Su, Yao Xu, An Zhang

Theor. Comput. Sci., 2020

2018

Approximation algorithms for the three-machine proportionate mixed shop scheduling.

Longcheng Liu, Yong Chen, Jianming Dong, Randy Goebel, Guohui Lin, Yue Luo, Guanqun Ni, Bing Su, An Zhang

CoRR, 2018

Approximation Algorithms for Two-Machine Flow-Shop Scheduling with a Conflict Graph.

Yinhui Cai, Guangting Chen, Yong Chen, Randy Goebel, Guohui Lin, Longcheng Liu, An Zhang

Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

Approximation Algorithms and a Hardness Result for the Three-Machine Proportionate Mixed Shop.

Longcheng Liu, Guanqun Ni, Yong Chen, Randy Goebel, Yue Luo, An Zhang, Guohui Lin

Proceedings of the Algorithmic Aspects in Information and Management, 2018

2017

Inverse minimum flow problem under the weighted sum-type Hamming distance.

Longcheng Liu, Wenhao Zheng, Chao Li

Discret. Appl. Math., 2017

2016

Capacity inverse minimum cost flow problems under the weighted Hamming distance.

Longcheng Liu, Enyu Yao

Optim. Lett., 2016

Inverse Multicast Quality of Service Routing Problem with Bandwidth and Delay Under the Weighted l_1 Norm.

Longcheng Liu, Yu'an Chen, Wenhao Zheng, Deqing Wang

Proceedings of the Testbeds and Research Infrastructures for the Development of Networks and Communities, 2016

2014

Competitive ratios for preemptive and non-preemptive online scheduling with nondecreasing concave machine cost.

Yiwei Jiang, Jueliang Hu, Longcheng Liu, Yuqing Zhu, T. C. E. Cheng

Inf. Sci., 2014

2013

Weighted inverse maximum perfect matching problems under the Hamming distance.

Longcheng Liu, Enyu Yao

J. Glob. Optim., 2013

Minimizing the maximum bump cost in linear extensions of a poset.

Biao Wu, Longcheng Liu, Enyu Yao

J. Comb. Optim., 2013

Inverse Maximum Flow Problems under the Combining Norms.

Longcheng Liu

Proceedings of the Frontiers in Algorithmics <i>and</i> Algorithmic Aspects in Information and Management, 2013

2012

Weighted Inverse Minimum Cut Problem under the Sum-Type Hamming Distance.

Longcheng Liu, Yong Chen, Biao Wu, Enyu Yao

Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2012

2011

Minimizing the sum cost in linear extensions of a poset.

Longcheng Liu, Biao Wu, Enyu Yao

J. Comb. Optim., 2011

2010

A polynomially solvable case of optimal linear extension problem of a poset.

Biao Wu, Enyu Yao, Longcheng Liu

J. Comb. Optim., 2010

Inverse minimum cost flow problems under the weighted Hamming distance.

Yiwei Jiang, Longcheng Liu, Biao Wu, Enyu Yao

Eur. J. Oper. Res., 2010

2009

Constrained inverse min-max spanning tree problems under the weighted Hamming distance.

Longcheng Liu, Qin Wang

J. Glob. Optim., 2009

2008

Inverse min-max spanning tree problem under the Weighted sum-type Hamming distance.

Longcheng Liu, Enyu Yao

Theor. Comput. Sci., 2008

2007

A Weighted Inverse Minimum Cut Problem under the Bottleneck Type Hamming Distance.

Longcheng Liu, Enyu Yao

Asia Pac. J. Oper. Res., 2007

2006

Inverse maximum flow problems under the weighted Hamming distance.

Longcheng Liu, Jianzhong Zhang

J. Comb. Optim., 2006