Data-Driven Approximations to NP-Hard Problems

    AAAI, pp. 1453-1459, 2017.

    Cited by: 31|Bibtex|Views26|Links
    EI

    Abstract:

    There exist a number of problem classes for which obtaining the exact solution becomes exponentially expensive with increasing problem size. The quadratic assignment problem (QAP) or the travelling salesman problem (TSP) are just two examples of such NP-hard problems. In practice, approximate algorithms are employed to obtain a suboptimal...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments