In graph clustering methods, MinMax Cut tends to provide more balanced clusters as compared to Ratio Cut and Normalized Cut. The traditional approach used spectral relaxation to solve the graph cut problem. The main disadvantage of this approach is that the obtained spectral solution has mixed signs, which could severely deviate from the true solution and have to resort to other clustering meth...

The paper scrutinizes various stylized facts related to the minmax theorem for chess. We first point out that, in contrast to the prevalent understanding, chess is actually an infinite game, so that backward induction does not apply in the strict sense. Second, we recall the original argument for the minmax theorem of chess which is forward rather than backward looking. Then it is shown that, a...

[4] Igor Averbakh. Minmax regret solutions for minmax optimization problems with uncertainty. [5] Igor Averbakh. On the complexity of a class of combinatorial optimization problems with uncertainty. [7] Igor Averbakh and Oded Berman. Minimax regret p-center location on a network with demand uncertainty. [8] Igor Averbakh and Oded Berman. Minmax p-traveling salesman location problems on a tree.

Content-based medical image retrieval can support diagnostic decisions by clinical experts. Examining similar images may provide clues to the expert to remove uncertainties in his/her final diagnosis. Beyond conventional feature descriptors, binary features in different ways have been recently proposed to encode the image content. A recent proposal is “Radon barcodes” that employ binarized Rado...

Recently, the economic crisis has resulted in instability in stock exchange market and this has caused high volatilities in stock value of exchanged firms. Under these conditions, considering uncertainty for a favorite investment is more serious than before. Multi-objective Portfolio selection (Return, Liquidity, Risk and Initial cost of Investment objectives) using MINMAX fuzzy goal programmin...

In this letter, we study the R-D properties of independent sources based on MSE and SSIM, and compare the bit allocation performance under the MINAVE and MINMAX criteria in video encoding. The results show that MINMAX has similar results in terms of average distortion with MINAVE by using SSIM, which illustrates the consistency between these two criteria in independent perceptual video coding. ...

In this paper we analyze the application of the Ant Colony Optimization to the Minimum Weight Vertex Covering Problem. We use the software system that we developed and implemented different standard ACO algorithms to this problem: Ant Colony System, the use of Elitism, Rank based approach and the MinMax system. We have made a comparative assessment of the effectiveness of these algorithms to th...

In this paper, we will study the existence problem of minmax minimal torus. We use classical conformal invariant geometric variational methods. We prove a theorem about the existence of minmax minimal torus in Theorem 5.1. Firstly we prove a strong uniformization result(Proposition 3.1) using method of [1]. Then we use this proposition to choose good parametrization for our minmax sequences. We...