Đ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

Không đóng trình duyệt đến khi xuất hiện nút 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

TÀI LIỆU LIÊN QUAN

On some generalized discrete logistic maps

Development of modified discrete particle swarm optimization algorithm for quadratic assignment problems

Some discrete optimization problems with hamming and H-comparability graphs

Báo cáo sinh học: "Homoclinic solutions of some second-order non-periodic discrete systems"

báo cáo hóa học:" Homoclinic solutions of some second-order non-periodic discrete systems"

Báo cáo toán học: " Homoclinic solutions of some second-order nonperiodic discrete systems"

Báo cáo hóa học: "EXACT KOLMOGOROV AND TOTAL VARIATION DISTANCES BETWEEN SOME FAMILIAR DISCRETE DISTRIBUTIONS"

Ebook Fundamentals of the finite element method for heat and fluid flow: Part 1

Ebook The finite element method (Volume 1: The basis - 5th edition): Part 1

Ebook The finite element method (5th edition) - Volume 1: The Basic
Đã phát hiện trình chặn quảng cáo AdBlock
Trang web này phụ thuộc vào doanh thu từ số lần hiển thị quảng cáo để tồn tại. Vui lòng tắt trình chặn quảng cáo của bạn hoặc tạm dừng tính năng chặn quảng cáo cho trang web này.