Abstract
Under study is the r-criteria problems for the r-weighted graphs (r ≥ 2). Certain kinds of subgraphs are called admissible. Solving some problem means choosing a Pareto optimal admissible subgraph from the complete set of alternatives (CSA). The main result of this paper is as follows: Suppose that a criterion denoted by MAXMIN requires maximization of the minimal first edges’ weight of the admissible subgraph and there is an effective procedure constructing the CSA for a (r − 1)-criteria problem without this MAXMIN criterion. Then the CSA for the initial r-criteria problem is created effectively.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
