Research from all publishers Notable progress has been made in the design and analysis of approximation methods for generalisations of the TSP. For instance, new work has explored the application ...

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 ...

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 ...

Such algorithms find approximate (slightly suboptimal) solutions to optimization problems in polynomial time. Unlike heuristics, approximation algorithms have provable performance guarantees: they ...

COMP_SCI 437: Approximation Algorithms VIEW ALL COURSE TIMES AND SESSIONS Prerequisites COMP_SCI 212 and COMP_SCI 336 (or similar courses) or CS MS or CS PhDs Description This course studies ...

This paper proposes an algorithm that automatically translates the "continuum approximation" (CA) recipes for location problems into discrete designs. It applies to terminal systems, but can also be ...

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 ...

The most recent class of control techniques to be used are collectively referred to as adaptive control. Although the basic algorithms have been known for decades, they have not been applied in ...