Performance modelling and automated algorithm design for NP-hard problems
In practical applications, some important classes of problems are NP-complete. Although no worst-case polynomial time algorithm exists for solving them, state-of-the-art algorithms can solve very large problem instances quickly, and algorithm performance varies significantly across instances. In add...
| Main Author: | |
|---|---|
| Language: | English |
| Published: |
University of British Columbia
2014
|
| Online Access: | http://hdl.handle.net/2429/51175 |