Đang chuẩn bị liên kết để tải về tài liệu:
Some variants of reverse selective center location problem on trees under the chebyshev and hamming norms

Đang chuẩn bị nút TẢI XUỐNG, xin hãy chờ

This paper is concerned with two variants of the reverse selective center location problems on tree graphs under the Hamming and Chebyshev cost norms in which the customers are existing on a selective subset of the vertices of the underlying tree. | Yugoslav Journal of Operations Research 27 (2017), Number 3, 367–384 DOI: 10.2298/YJOR160317012E SOME VARIANTS OF REVERSE SELECTIVE CENTER LOCATION PROBLEM ON TREES UNDER THE CHEBYSHEV AND HAMMING NORMS Roghayeh ETEMAD Department of Applied Mathematics, Faculty of Basic Sciences, Sahand University of Technology, Tabriz, Iran. r etemad@sut.ac.ir Behrooz ALIZADEH* Department of Applied Mathematics, Faculty of Basic Sciences, Sahand University of Technology, Tabriz, Iran alizadeh@sut.ac.ir, brz alizadeh@yahoo.com Received: March 2016 / Accepted: June 2016 Abstract: This paper is concerned with two variants of the reverse selective center location problems on tree graphs under the Hamming and Chebyshev cost norms in which the customers are existing on a selective subset of the vertices of the underlying tree. The first model aims to modify the edge lengths within a given modification budget until a prespecified facility location becomes as close as possible to the customer points. However, the other model wishes to change the edge lengths at the minimum total cost so that the distances between the prespecified facility and the customers satisfy a given upper bound. We develop novel combinatorial algorithms with polynomial time complexities for deriving the optimal solutions of the problems under investigation. Keywords: Center Location Problems, Combinatorial Optimization, Reverse Optimization, Tree Graphs, Time Complexity. MSC: 90C27; 90B80; 90B85; 90C35. *Corresponding author 368 R. Etemad, B. Alizadeh / Reverse Selective Center Location Problem 1. INTRODUCTION Facility location problems are fundamental optimization models in operations research which are concerned with locating facilities on a system in order to serve a given set of customers in an optimal way under certain assessment criteria. In recent years, different variants of these problems have found significant interest due to their applications in theory and practice. Two widely investigated .

TAILIEUCHUNG - Chia sẻ tài liệu không giới hạn
Địa chỉ : 444 Hoang Hoa Tham, Hanoi, Viet Nam
Website : tailieuchung.com
Email : tailieuchung20@gmail.com
Tailieuchung.com là thư viện tài liệu trực tuyến, nơi chia sẽ trao đổi hàng triệu tài liệu như luận văn đồ án, sách, giáo trình, đề thi.
Chúng tôi không chịu trách nhiệm liên quan đến các vấn đề bản quyền nội dung tài liệu được thành viên tự nguyện đăng tải lên, nếu phát hiện thấy tài liệu xấu hoặc tài liệu có bản quyền xin hãy email cho chúng tôi.
Đã 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.