The University of Waterloo,
Department of Combinatorics and Optimization,
Waterloo, Ontario, Canada N2L 3G1
The breathtaking progress in algorithmic nonlinear optimization, but also in computer hardware has thrown new light on the analysis of NP-hard problems. Recently, a major break-through was achieved to solve QAP of sizes (n=30) unthinkable by conventional methods. This progress was due in part to a new nonlinear relaxation for QAP, but also to new computing facilities, allowing for massive parallel computation. Similar progress is also made in other areas, such as clique and coloring on massive graphs.
The aim of the workshop is therefore to bring together researchers from several communities, such as:
Topics to be covered include:
Please see the
workshop web page for more updated information.
A proceedings of refereed invited papers is planned.