Learn how to use online, approximation, parallel, randomized, streaming, and machine learning algorithms to optimize your performance and results.

The travelling salesman problem (TSP) remains one of the most challenging NP‐hard problems in combinatorial optimisation, with significant implications for logistics, network design and route ...

Kaourintin Le Guiban, Arpad Rimmel, Marc-Antoine Weisser, Joanna Tomasik, The First Approximation Algorithm for the Maximin Latin Hypercube Design Problem, Operations Research, Vol. 66, No. 1 (Janaury ...

This paper introduces a heuristic algorithm that approximates the filter coefficients to the neighbouring values, which have a larger number of zeros in the canonical signed digit (CSD) representation ...

Approximate computing, as an emerging computational paradigm that improves energy efficiency at the cost of accuracy loss, provides a new approach for energy-efficient design of fault-tolerant systems ...

Understand how approximation algorithms compute solutions that are guaranteed to be within some constant factor of the optimal solution. Develop a basic understanding of how linear and integer ...

Richard Hoshino, Ken-ichi Kawarabayashi, An Approximation Algorithm for the Bipartite Traveling Tournament Problem, Mathematics of Operations Research, Vol. 38, No. 4 (November 2013), pp. 720-728 ...

Id: 036940 Credits Min: 3 Credits Max: 3 Description This course covers advanced topics in approximation algorithms for NP-hard problems, including combinatorial algorithms and LP-based algorithms for ...

Although efficient in a strictly theoretical sense (i.e., in the sense of taking polynomial versus exponential time), this algorithm for the permanent is not practical. Indeed, to date, no practical ...