Ordered Weighted Average optimization in Multiobjective Spanning Tree Problem

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Exact algorithms for OWA-optimization in multiobjective spanning tree problems

This paper deals with the multiobjective version of the optimal spanning tree problem. More precisely, we are interested in determining the optimal spanning tree according to an Ordered Weighted Average (OWA) of its objective values. We first show that the problem is weakly NP-hard. We then propose different mixed integer programming formulations, according to different subclasses of OWA functi...

متن کامل

On an Online Spanning Tree Problem in Randomly Weighted Graphs

This paper is devoted to an online variant of the minimum spanning tree problem in randomly weighted graphs. We assume that the input graph is complete and the edge weights are uniform distributed over [0, 1]. An algorithm receives the edges one by one and has to decide immediately whether to include the current edge into the spanning tree or to reject it. The corresponding edge sequence is det...

متن کامل

Benchmark Problem Generators and Results for the Multiobjective Degree-Constrained Minimum Spanning Tree Problem

Finding a minimum-weight spanning tree (MST) in a graph is a classic problem in operational research (OR) with important applications in network design. In this paper , we consider the degree-constrained mul-tiobjective MST problem, which is NP-hard. We present several diierent parameterized problem generators for producing MST instances with diierent problem features, including any number of o...

متن کامل

Ant Colony Optimization and the Minimum Spanning Tree Problem

Ant Colony Optimization (ACO) is a kind of randomized search heuristic that has become very popular for solving problems from combinatorial optimization. Solutions for a given problem are constructed by a random walk on a so-called construction graph. This random walk can be influenced by heuristic information about the problem. In contrast to many successful applications, the theoretical found...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: European Journal of Operational Research

سال: 2017

ISSN: 0377-2217

DOI: 10.1016/j.ejor.2016.10.016