Pablo San Segundo

Chess GrandMaster. Associate Professor at University @La_UPM. Researcher on graphs and combinatorial optimization. Founder @biicode

[Pablo San Segundo @pablosansegundo]

@GM_Gabuzyan 😄

[Fabio Furini @FabioFurini]

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:

https://t.co/tcBEEdDII3

and the executable is here:

https://t.co/OqWKdVOZAJ

[Fabio Furini @FabioFurini]

The binary of the exact algorithm is now available at:

https://t.co/OqWKdVOrLb

as well as the complete library of MCP instances.

If you have maximum clique problems to solve please try also our new code

[Fabio Furini @FabioFurini]

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

https://t.co/GeFKE86HdQ

[Ali Mortazavi @AAMortazavi]

Looks impossible but white to play and win. #chess #Chess

[Fabio Furini @FabioFurini]

We have just uploaded on GitHub the CFS exact algorithm for the Knapsack Problem with Conflicts:

https://t.co/EWA5F6DvvA

If interested, more information can be found here:

https://t.co/8T4HjpGOp9

Happy new year in advance!

[Fabio Furini @FabioFurini]

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 :-)

https://t.co/yZdyEz7n2e

The solver is here:

https://t.co/UYzHEYclK0

[Fabio Furini @FabioFurini]

Freshly baked new lower bounds for Ramsey numbers based on bilevel optimization, please have a look:

https://t.co/FluT1H9PMt

[Ivana Ljubic @ILjubic]

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.

https://t.co/HdewJqvVdw

#orms

@ESSECKnowledge
@TheSIAMNews
@FabioFurini
@pablosansegundo

[Fabio Furini @FabioFurini]

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: https://t.co/wB4RE21jJd

[Pablo San Segundo @pablosansegundo]

@ILjubic @FabioFurini @pablosansegundo The students were really good!

[Pablo San Segundo @pablosansegundo]

The 2048 node graph 2dc.2048 derived from Two-Deletion-Correcting Code is now solved after the 15th day of computation.

[Pablo San Segundo @pablosansegundo]

Near 500 problems solved now of the open graph problem 2dc.2048. Getting some acceleration as the subproblems become smaller. 13th day.

[Pablo San Segundo @pablosansegundo]

Solved 300 subproblems of the open graph problem 2dc.2048 from coding theory https://t.co/lZiskO1lkM. 10th day. 4x more is our estimate.

[Pablo San Segundo @pablosansegundo]

Close to solving 200 subproblems of the open graph problem 2dc.2048 from coding theory https://t.co/lZiskO1lkM. 7th day of computation.

[Pablo San Segundo @pablosansegundo]

Searched the first 100 subproblems of the open graph problem 2dc.2048 https://t.co/lZiskO1lkM . It will take x10 to be close to solving it.

[Pablo San Segundo @pablosansegundo]

Trying to close the open graph problem 2dc.2048 from coding theory https://t.co/lZiskO1lkM. A huge task!

[Pablo San Segundo @pablosansegundo]

Infra-chromatic maximum clique solver BBMCX is now on our test framework.
https://t.co/c2JT4X14Bd

[Pablo San Segundo @pablosansegundo]

Research on bit-parallel exact maximum clique algorithm BBMCSP tailored for massive graphs is now publiclyavailable.

http://t.co/1pFgEe1Vsk

[Pablo San Segundo @pablosansegundo]

Recent work on infra-chromatic bounds for exact maximum clique search is now temporarily available at http://t.co/clrtfZIUUm