Multi-agent systems are widely used to address large-scale distributed combinatorial applications in the real world. One such application is meeting scheduling (MS), which is deï¬...
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
In our prior work, we presented a highly effective local search based heuristic algorithm called the Largest Expanding Sweep Search (LESS) to solve the minimum energy broadcast (M...
We consider the following one- and two-dimensional bucketing problems: Given a set S of n points in R1 or R2 and a positive integer b, distribute the points of S into b equal-size ...
Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep ...
—As more and more real-world optimization problems become increasingly complex, algorithms with more capable optimizations are also increasing in demand. For solving large scale ...