Pablo San Segundo retweeted
Finally, we have the state-of-the-art algorithm for the Maximum Clique Problem, joined work with @pablosansegundo Panos Pardalos and David Álvarez
More details on the new CliSAT algorithm are here:
authors.elsevier.com/c/1g1VY…
and the executable is here:
github.com/psanse/CliSAT
Pablo San Segundo retweeted
The binary of the exact algorithm is now available at:
github.com/psanse/CliSAT
as well as the complete library of MCP instances.
If you have maximum clique problems to solve please try also our new code
Pablo San Segundo retweeted
A brand-new state-of-the-art exact algorithm for **HARD** maximum clique problems, it has been **VERY HARD** but we finally got good results :-) together with @pablosansegundo, David Alvarez, and Panos Pardalos
optimization-online.org/DB_H…
Pablo San Segundo retweeted
We have just uploaded on GitHub the CFS exact algorithm for the Knapsack Problem with Conflicts:
github.com/psanse/kpcg
If interested, more information can be found here:
sciencedirect.com/science/ar…
Happy new year in advance!
Pablo San Segundo retweeted
A brand new exact algorithm for Binary Constraint
Satisfaction Problems. With @pablosansegundo and Rafael Leon, we managed to outperform four SAT-based solvers and three general purpose CP solvers :-)
sciencedirect.com/science/ar…
The solver is here:
github.com/psanse/Bfilt
Pablo San Segundo retweeted
Freshly baked new lower bounds for Ramsey numbers based on bilevel optimization, please have a look:
optimization-online.org/DB_F…
Pablo San Segundo retweeted
I have a great honor to give an opening plenary for the SIAM conference on optimization today at 5.45pm (CET).
I will connect the #RamseyTheory with #Bilevel #Optimization.
meetings.siam.org/sess/dsp_p…
#orms
@ESSECKnowledge
@TheSIAMNews
@FabioFurini
@pablosansegundo
Pablo San Segundo retweeted
A new branch-and-filter exact algorithm for Binary Constraint Satisfaction Problems! We managed to outperform 3 SAT-based solvers and 2 Constraint Programming solvers! @pablosansegundo
Please have a look: optimization-online.org/DB_H…
The 2048 node graph 2dc.2048 derived from Two-Deletion-Correcting Code is now solved after the 15th day of computation. – at Madrid, Comunidad de Madrid
Near 500 problems solved now of the open graph problem 2dc.2048. Getting some acceleration as the subproblems become smaller. 13th day. – at Madrid, Comunidad de Madrid
Solved 300 subproblems of the open graph problem 2dc.2048 from coding theory neilsloane.com/doc/graphs.ht…. 10th day. 4x more is our estimate. – at Murcia, Spain
Close to solving 200 subproblems of the open graph problem 2dc.2048 from coding theory neilsloane.com/doc/graphs.ht…. 7th day of computation.
Searched the first 100 subproblems of the open graph problem 2dc.2048 neilsloane.com/doc/graphs.ht… . It will take x10 to be close to solving it. – at Murcia, Spain
Trying to close the open graph problem 2dc.2048 from coding theory neilsloane.com/doc/graphs.ht…. A huge task! – at Murcia, Spain
Infra-chromatic maximum clique solver BBMCX is now on our test framework.
biicode.com/pablodev/example… – at Madrid, Comunidad de Madrid
Research on bit-parallel exact maximum clique algorithm BBMCSP tailored for massive graphs is now publiclyavailable.
authors.elsevier.com/a/1RfAe… – at Madrid, Comunidad de Madrid
Recent work on infra-chromatic bounds for exact maximum clique search is now temporarily available at authors.elsevier.com/a/1RNy8… – at Madrid, Comunidad de Madrid
In @biicode, released state-of-the-art exact maximum clique family of BBMC algorithms for researchers in the field. biicode.com/pablodev/example… – at Madrid, Comunidad de Madrid
Pablo San Segundo retweeted
.@pablosansegundo post on Maximum Clique is in @OReillyMedia's Four short links: 10 April 2015 radar.oreilly.com/2015/04/fo…