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

From MaRDI portal
Publication:2125230

DOI10.1007/s10878-021-00793-3zbMath1490.90238OpenAlexW3194595331MaRDI QIDQ2125230

Longcheng Liu, Bing Su, Yong Chen, Guangting Chen, An Zhang, Randy Goebel, Yinhui Cai, Guo-Hui Lin

Publication date: 13 April 2022

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-021-00793-3




Related Items (2)



Cites Work


This page was built for publication: Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph