In this paper, we study the “Multi-Robot Routing problem” with min–max objective (MRR-MM) in detail. It involves assignment of sequentially ordered tasks to robots such that maximum cost slowest robot is minimized. The problem description, different types formulations, and methods used across various research communities are discussed paper. We propose a new formulation by treating as permutati...

In the ongoing power system reform in Japan, division of transmission and distribution is separated from former general electric utility became a business operator. After reform, operators will procure reserve market. We have formulated clearing problem market as 0-1 integer programming problem. This can be viewed Min-Max set multi-cover Since covering belongs NP-hard, it not easy to solve larg...

We give a deterministic polynomial-time algorithm which for any given average degree d and asymptotically almost all random graphs G in G(n,m = d2n ) outputs a cut of G whose ratio (in cardinality) with the maximum cut is at least 0.952. We remind the reader that it is known that unless P=NP, for no constant > 0 is there a Max-Cut approximation algorithm that for all inputs achieves an approxim...