Francesco Cavaliere

Postdoc at unipd - Parkour practitioner

[Subject to @Subjectto_]

Subject to: Timo Berthold (FICO & TU Berlin), https://t.co/Sh56QYPqSx, #orms #optimization #Analytics #MIP @timoberthold @FICO_corp @FICO_Xpress @TUBerlin @ZuseInstitute

[Alice Raffaele @AliceRaffaele1]

@hri_lefebvre, so well deserved! Congratulations! #orms #EURO2024CPH #EDDA

[Maria @Rainbow_Battarr]

A special mug to @AliceRaffaele1 from @Subjectto_ #euro24

[Matteo Fischetti @MFischetti]

After the #reading_group of today, we decided to study @ginosorbillo’s #pineapple pizza—but the younger ones weren't brave enough… @DPalasgo Federico Michelotto @FrnCava @MFischetti @dominiqs81 Roberto Roberti @AliceRaffaele1

[Francesco Cavaliere @FrnCava]

🎉

[daniele vigo @DanieleVigo]

https://t.co/psiMOw90Ao

Happy to share the last evolution of FILO designed to solve large-scale pickup and delivery problems

[daniele vigo @DanieleVigo]

And … dulcis in fundo, Alan Osorio defends … congrats to all candidates was a pleasure having them in bologna … to see them flying away …

[daniele vigo @DanieleVigo]

Or-dense phd defense session ! Now Silvia Anna Cordieri defends her thesis on optimization for multi
Energy systems …

[daniele vigo @DanieleVigo]

Francesco cavaliere is defending today his phd thesis !!!

[Thibaut Vidal @vidalthi]

*Trained Random Forests Completely Reveal your Dataset!* https://t.co/hMmDkiNFSe
#MachineLearning models encode extensive information that can be exploited to reconstruct most --if not all-- of their private training data. Wanna know how? Buckle up! (1/8)

[Alice Raffaele @AliceRaffaele1]

#UrobORosDEI Easter dinner @DPalasgo, @FrnCava, @dominiqs81, and Roberto Roberti (@MFischetti, you were missed!) #orms

[AIROyoung @AIROyoung]

#8AYW #Day3 #OptimizationOnGraphs
Federico Michelotto presents a lower-bound procedure and a heuristic algorithm for the problem of designing survivable telecommunication networks with shared-protection routing robust against single link failures #orms

[AIROyoung @AIROyoung]

#8AYW #Day3 #DynamicUncertainOptimization
@AliceRaffaele1 combines stochastic dynamic programming with robust optimization to tackle a multi-stage assignment problem with uncertain demand to minimize fleet sizing and customer inconvenience costs #orms

[AIROyoung @AIROyoung]

#8AYW #Day3 #DynamicUncertainOptimization
@FrnCava introduces a novel formulation for the Time Window Assignment Traveling Salesperson Problem with Stochastic Travel Times and exploits Benders' decomposition #orms

[AIROyoung @AIROyoung]

#8AYW #Day2 #Logistics
@DPalasgo talks about #ColumnGeneration algorithms using fragments to compute tight dual bounds to the Pickup and Delivery Problem with Time Windows and Last-in-First-out Loading #orms

[AIROyoung @AIROyoung]

#8AYW #Day2 #PlenaryLecture
The second keynote speaker is Prof. @DanieleVigo (@Unibo), who presents different heuristic approaches developed with several former Ph.D. students (among which Luca Accorsi and @FrnCava) to solve Vehicle Routing Problems #orms 1/n

[Francesco Cavaliere @FrnCava]

@krisjusiak Interesting approach! I've been experimenting with a similar trick but added support for failed tests too
https://t.co/Rfus45XLEZ

[daniele vigo @DanieleVigo]

https://t.co/mQhlrOcvtZ

Very excited to share my last joint effort with Luca accorsi to push forward the frontier of large scale routing optimization.

[Tech At Bloomberg @TechAtBloomberg]

Want to watch @seanbax's talk entitled “#Circle evolves C++ to fix defects + make the language safer & more productive,” which he gave to Bloomberg's C++ engineers earlier this year?
https://t.co/SkaUVV1KTj
#cpp #cplusplus #cpp20

[Sean Baxter @seanbax]

I have my first working C++ NLL borrow checker tests.

Use the ^ (shared) and ^^ (mut) borrow types. The "no mutable aliasing" rule is enforced at compile time.

The birth of Memory Safe C++!

[Bill Cook @wjcook]

@timoberthold pla85900 itself is likely easier to solve than 85,900 points randomly distributed in a unit square, due to the co-linear points in the VLSI application. We have been unable to solve a 100,000-point random instance created by David Johnson in 2000 for the DIMACS TSP Challenge.