刘龙城｜厦门大学｜学者主页

2022

一类一维在线单位聚类问题的随机近似算法

代宇波，段懿红，刘龙城，王子豪

《运筹学学报(中英文)》

2021

路上的半厌恶型设施选址博弈的机制设计

姜秀秀，姜永，刘龙城，朱李岑

《厦门大学学报(自然科学版)》

2021

Constrained inverse minimum flow problems under the weighted Hamming distance

Yong Jiang, Weifeng Lin, Longcheng Liu, Anzhen Peng

Theoretical Computer Science

DOI

2021

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, Guang-Ting Chen, R. Goebel, Guo-Hui Lin, Bing Su, An Zhang

Journal of combinatorial optimization

DOI

2020

Improved approximation algorithms for two-stage flexible flow shop scheduling

Anzhen Peng, Longcheng Liu, Weifeng Lin

Journal of combinatorial optimization

DOI

2019

Approximation algorithms for the three-machine proportionate mixed shop scheduling

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

Theoretical Computer Science

DOI

2019

Online Scheduling with Unit Processing Times and Processing Set Restrictions

Yong Chen, Guang-Ting Chen, Longcheng Liu, Yiwei Jiang, Zhiyi Tan, An Zhang

Journal of the Operations Research Society of China

DOI

2019

A Local Search 4/3-approximation Algorithm for the Minimum 3-path Partition Problem

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

Lecture notes in computer science

DOI

2019

Inverse Maximum Flow Problem Under the Combination of the Weighted l $$_2$$ 2 Norm and the Weighted Hamming Distance

Longcheng Liu, Hang Gao, Chao Li

Journal of the Operations Research Society of China

DOI

2018

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

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

Lecture notes in computer science

DOI

2018

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

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

Lecture notes in computer science

DOI

2018

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

Yong Chen, R. Goebel, Guo-Hui Lin, Longcheng Liu, Bing Su, Wei-Tian Tong, Yao Xu, An Zhang

Journal of combinatorial optimization

DOI

2017

容量型最小费用流逆问题的可行性研究

刘龙城，李超，崔佳

《厦门大学学报(自然科学版)》

2017

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

Longcheng Liu, Wenhao Zheng, Chao Li

Discrete Applied Mathematics

DOI

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

Testbeds and Research Infrastructures for the DEvelopment of NeTworks and COMmunities

DOI

2015

Capacity inverse minimum cost flow problems under the weighted Hamming distance

Longcheng Liu, Enyu Yao

Optimization Letters

DOI

2014

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

Yi-Wei Jiang, Jue-Liang Hu, Longcheng Liu, Yu-Qing Zhu, T. C. Edwin Cheng

Information Sciences

DOI

2013

Weighted inverse maximum perfect matching problems under the Hamming distance

Longcheng Liu, En-Yu Yao

Journal of Global Optimization

DOI

2013

Inverse Maximum Flow Problems under the Combining Norms

Longcheng Liu

FAW-AAIM

DOI

2013

Minimizing the maximum bump cost in linear extensions of a poset

Biao Wu, Longcheng Liu, En-Yu Yao

Journal of combinatorial optimization

DOI

2012

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

Longcheng Liu, Yong Chen, Biao Wu, En-Yu Yao

FAW-AAIM

DOI

2011

Minimizing the sum cost in linear extensions of a poset

Longcheng Liu, Biao Wu, En-Yu Yao

Journal of combinatorial optimization

DOI

2010

Inverse minimum cost flow problems under the weighted Hamming distance

Yiwei Jiang, Longcheng Liu, Biao Wu, Enyu Yao

European Journal Of Operational Research，Vol. 207, No. 1

DOI

2009

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

Biao Wu, Enyu Yao, Longcheng Liu

Journal of Combinatorial Optimization

DOI

2009

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

Longcheng Liu, Qin Wang

Journal of Global Optimization

DOI

2007

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

Longcheng Liu, En-Yu Yao

Theoretical Computer Science

DOI

2007

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

Longcheng Liu, En-Yu Yao

Asia Pac. J. Oper. Res.

DOI

2006

Inverse maximum flow problems under the weighted Hamming distance

Longcheng Liu, Jianzhon Zhang

Journal of combinatorial optimization

DOI

2006

Inverse minimum spanning tree problem and reverse shortest-path problem with discrete values

Longcheng Liu, Yong He

DOI

刘龙城

精选作品

期刊论文

一类一维在线单位聚类问题的随机近似算法

路上的半厌恶型设施选址博弈的机制设计

Constrained inverse minimum flow problems under the weighted Hamming distance

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

Improved approximation algorithms for two-stage flexible flow shop scheduling

Approximation algorithms for the three-machine proportionate mixed shop scheduling

Online Scheduling with Unit Processing Times and Processing Set Restrictions

A Local Search 4/3-approximation Algorithm for the Minimum 3-path Partition Problem

Inverse Maximum Flow Problem Under the Combination of the Weighted l $$_2$$ 2 Norm and the Weighted Hamming Distance

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

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

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

容量型最小费用流逆问题的可行性研究

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

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

Capacity inverse minimum cost flow problems under the weighted Hamming distance

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

Weighted inverse maximum perfect matching problems under the Hamming distance

Inverse Maximum Flow Problems under the Combining Norms

Minimizing the maximum bump cost in linear extensions of a poset

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

Minimizing the sum cost in linear extensions of a poset

Inverse minimum cost flow problems under the weighted Hamming distance

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

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

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

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

Inverse maximum flow problems under the weighted Hamming distance

Inverse minimum spanning tree problem and reverse shortest-path problem with discrete values

研究方向