Abstract: In scheduling theory, the non-preemptive scheduling on a single machine of jobs with increasing processing times and release dates for total completion time minimization is known to be a ...

The ATA algorithm provides a novel approximation framework for analytic functions that cannot be expressed in closed-form via elementary or algebraic functions. It ...

The stochastic root-finding problem is that of finding a zero of a vector-valued function known only through a stochastic simulation. The simulation-optimization problem is that of locating a ...

Abstract: Real-time applications, such as ticket booking systems, video streaming systems, social networking services, and online games, are prevalent nowadays. Low latency between a user and a server ...

The Traveling Salesman Problem (TSP) is a well-known problem in optimization, where the objective is to find the shortest route to visit all cities and return to the starting point. This project ...

Nash equilibria represent a cornerstone in game theory, defining strategy profiles wherein no player can benefit by unilaterally deviating. This concept underpins a myriad of applications, ranging ...

This course studies approximation algorithms – algorithms that are used for solving hard optimization problems. Such algorithms find approximate (slightly suboptimal) solutions to optimization ...

Mark Jerrum, Alistair Sinclair (UC Berkeley) and Eric Vigoda (Georgia Tech) received the Association for Computing Machinery (ACM) Test of Time Award at a virtual ceremony on Wednesday 23 June at the ...