BiqCrunch | Zendy

Nathan Krislock | Zendy; Jérôme Malick | Zendy; Frédéric Roupin | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

BiqCrunch

Author(s) -

Nathan Krislock,

Jérôme Malick,

Frédéric Roupin

Publication year - 2017

Publication title -

acm transactions on mathematical software

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.767

H-Index - 87

eISSN - 1557-7295

pISSN - 0098-3500

DOI - 10.1145/3005345

Subject(s) - bounding overwatch , solver , computer science , quadratic assignment problem , set (abstract data type) , combinatorial optimization , variety (cybernetics) , optimization problem , extremal optimization , branch and bound , code (set theory) , algorithm , theoretical computer science , mathematical optimization , mathematics , programming language , artificial intelligence , multi swarm optimization

International audienceThis paper presents BiqCrunch, an exact solver for binary quadratic optimization problems. BiqCrunch is a branch-and-bound method that uses an original, efficient semidefinite-optimization-based bounding procedure. It has been successfully tested on a variety of well-known combinatorial optimization problems, such as Max-Cut, Max-k-Cluster, and Max-Independent-Set. The code is publicly available online; a web interface and many conversion tools are also provided

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research