Đang chuẩn bị liên kết để tải về tài liệu:
Some discrete optimization problems with hamming and H-comparability graphs
Đang chuẩn bị nút TẢI XUỐNG, xin hãy chờ
Tải xuống
Any H-comparability graph contains a Hamming graph as spanning subgraph. An acyclic orientation of an H-comparability graph contains an acyclic orientation of the spanning Hamming graph, called sequence graph in the classical open-shop scheduling problem. We formulate different discrete optimization problems on the Hamming graphs and on H-comparability graphs and consider their complexity and relationship. Moreover, we explore the structures of these graphs in the class of irreducible sequences for the open shop problem in this paper. | Some discrete optimization problems with hamming and H-comparability graphs