Longcheng Liu

Orcid: 0000-0001-6801-9208

According to our database1, Longcheng Liu authored at least 25 papers between 2006 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
OIPNet: Multimodal Network with Orthogonal Information Processing for Semantic Segmentation in Indoor Scenes.
Int. J. Pattern Recognit. Artif. Intell., December, 2023

2022
A local search 4/3-approximation algorithm for the minimum 3-path partition problem.
J. Comb. Optim., 2022

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

2021
A Novel Model-Based Voltage Construction Method for Robust State-of-Health Estimation of Lithium-Ion Batteries.
IEEE Trans. Ind. Electron., 2021

Constrained inverse minimum flow problems under the weighted Hamming distance.
Theor. Comput. Sci., 2021

Improved approximation algorithms for two-stage flexible flow shop scheduling.
J. Comb. Optim., 2021

2020
Approximation algorithms for the three-machine proportionate mixed shop scheduling.
Theor. Comput. Sci., 2020

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

Approximation Algorithms for Two-Machine Flow-Shop Scheduling with a Conflict Graph.
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

Approximation Algorithms and a Hardness Result for the Three-Machine Proportionate Mixed Shop.
Proceedings of the Algorithmic Aspects in Information and Management, 2018

2017
Inverse minimum flow problem under the weighted sum-type Hamming distance.
Discret. Appl. Math., 2017

2016
Capacity inverse minimum cost flow problems under the weighted Hamming distance.
Optim. Lett., 2016

Inverse Multicast Quality of Service Routing Problem with Bandwidth and Delay Under the Weighted l_1 Norm.
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.
Inf. Sci., 2014

2013
Weighted inverse maximum perfect matching problems under the Hamming distance.
J. Glob. Optim., 2013

Minimizing the maximum bump cost in linear extensions of a poset.
J. Comb. Optim., 2013

Inverse Maximum Flow Problems under the Combining Norms.
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.
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.
J. Comb. Optim., 2011

2010
A polynomially solvable case of optimal linear extension problem of a poset.
J. Comb. Optim., 2010

Inverse minimum cost flow problems under the weighted Hamming distance.
Eur. J. Oper. Res., 2010

2009
Constrained inverse min-max spanning tree problems under the weighted Hamming distance.
J. Glob. Optim., 2009

2008
Inverse min-max spanning tree problem under the Weighted sum-type Hamming distance.
Theor. Comput. Sci., 2008

2007
A Weighted Inverse Minimum Cut Problem under the Bottleneck Type Hamming Distance.
Asia Pac. J. Oper. Res., 2007

2006
Inverse maximum flow problems under the weighted Hamming distance.
J. Comb. Optim., 2006


  Loading...