Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

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

L. Liu, W. Zheng, and C. Li. Discret. Appl. Math., (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Liu Liu

Dongmei Liu

Yinghao Liu

Other publications of authors with the same name

A Local Search 4/3-approximation Algorithm for the Minimum 3-path Partition Problem.Y. Chen, R. Goebel, G. Lin, L. Liu, B. Su, W. Tong, Y. Xu, and A. Zhang. FAW, volume 11458 of Lecture Notes in Computer Science, page 14-25. Springer, (2019)Approximation algorithms for the three-machine proportionate mixed shop scheduling.L. Liu, Y. Chen, J. Dong, R. Goebel, G. Lin, Y. Luo, G. Ni, B. Su, Y. Xu, and A. Zhang. Theor. Comput. Sci., (2020)Inverse minimum flow problem under the weighted sum-type Hamming distance.L. Liu, W. Zheng, and C. Li. Discret. Appl. Math., (2017)Weighted Inverse Minimum Cut Problem under the Sum-Type Hamming Distance.L. Liu, Y. Chen, B. Wu, and E. Yao. FAW-AAIM, volume 7285 of Lecture Notes in Computer Science, page 26-35. Springer, (2012)Inverse Min-Max Spanning Tree Problem Under the Weighted Sum-Type Hamming Distance.L. Liu, and E. Yao. ESCAPE, volume 4614 of Lecture Notes in Computer Science, page 375-383. Springer, (2007)Inverse Maximum Flow Problems under the Combining Norms.L. Liu. FAW-AAIM, volume 7924 of Lecture Notes in Computer Science, page 221-230. Springer, (2013)Inverse Multicast Quality of Service Routing Problem with Bandwidth and Delay Under the Weighted l_1 Norm.L. Liu, Y. Chen, W. Zheng, and D. Wang. TRIDENTCOM, volume 177 of Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, page 158-167. Springer, (2016)Competitive ratios for preemptive and non-preemptive online scheduling with nondecreasing concave machine cost.Y. Jiang, J. Hu, L. Liu, Y. Zhu, and T. Cheng. Inf. Sci., (2014)Improved approximation algorithms for two-stage flexible flow shop scheduling.A. Peng, L. Liu, and W. Lin. J. Comb. Optim., 41 (1): 28-42 (2021)Approximation Algorithms and a Hardness Result for the Three-Machine Proportionate Mixed Shop.L. Liu, G. Ni, Y. Chen, R. Goebel, Y. Luo, A. Zhang, and G. Lin. AAIM, volume 11343 of Lecture Notes in Computer Science, page 268-280. Springer, (2018)

BibSonomy

Disambiguation of "Liu, Longcheng"

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

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

Please choose a person to relate this publication to

Liu Liu

Liu Liu

Liu Liu

Dongmei Liu

Yinghao Liu

Other publications of authors with the same name

Disambiguation

BibSonomy

Disambiguation of "Liu, Longcheng"

copydeleteadd this publication to your clipboardcommunity posthistory of this postURLDOIBibTeXEndNoteAPAChicagoDIN 1505HarvardMSOffice XML Inverse minimum flow problem under the weighted sum-type Hamming distance.

Please choose a person to relate this publication to

Liu Liu

Liu Liu

Liu Liu

Dongmei Liu

Yinghao Liu

Other publications of authors with the same name

Disambiguation

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

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