Transforming an Arbitrary Minsum Problem into a Binary One
نویسندگان
چکیده
In this report we show, that an arbitrary MinSum problem (i.e. a MinSum problem with an arbitrary finite set of states) can be adequately transformed into a binary one (i.e. into a MinSum problem with only two states). Consequently all known results for binary MinSum problems can be easily extended to the general case. For instance it gives the possibility to solve exactly submodular MinSum problems with more than two states by using MinCut-MaxFlow based technics. CONTENTS
منابع مشابه
Exact Solution of Permuted Submodular MinSum Problems
In this work we show, that for each permuted submodular MinSum problem (Energy Minimization Task) the corresponding submodular MinSum problem can be found in polynomial time. It follows, that permuted submodular MinSum problems are exactly solvable by transforming them into corresponding submodular tasks followed by applying standart approaches (e.g. using MinCutMaxFlow based techniques).
متن کاملA Mathematical Optimization Model for Solving Minimum Ordering Problem with Constraint Analysis and some Generalizations
In this paper, a mathematical method is proposed to formulate a generalized ordering problem. This model is formed as a linear optimization model in which some variables are binary. The constraints of the problem have been analyzed with the emphasis on the assessment of their importance in the formulation. On the one hand, these constraints enforce conditions on an arbitrary subgraph and then g...
متن کاملOn the Equivalence of Constraint Satisfaction Problems
A solution of a Constraint Satisfaction Problem (CSP) is an assignment of values to all its variables such that all its constraints are satis ed. Usually two CSPs are considered equivalent if they have the same solution set. We nd this de nition limiting, and develop a more general de nition based on the concept of mutual reducibility. In this extended scheme it is reasonable to consider a pair...
متن کاملA New Heuristic Algorithm for Drawing Binary Trees within Arbitrary Polygons Based on Center of Gravity
Graphs have enormous usage in software engineering, network and electrical engineering. In fact graphs drawing is a geometrically representation of information. Among graphs, trees are concentrated because of their ability in hierarchical extension as well as processing VLSI circuit. Many algorithms have been proposed for drawing binary trees within polygons. However these algorithms generate b...
متن کاملCombining Minsum And Minmax: A Goal Programming Approach
A number of methods for multiple-objective optimization problems (MOP) give as solution to MOP the set of optimal solutions for some single-objective optimization problems associated with it. Well-known examples of these single-objective optimization problems are the minsum and the minmax. In this note, we propose a new parametric single-objective optimization problem associated with MOP by mea...
متن کامل