Postdoc at unipd - Parkour practitioner
Joined May 2019
- Tweets82
- Following210
- Followers70
- Likes613
Francesco Cavaliere retweeted
Subject to: Timo Berthold (FICO & TU Berlin), youtu.be/z-c7OMtClmY, #orms #optimization #Analytics #MIP @timoberthold @FICO_corp @FICO_Xpress @TUBerlin @ZuseInstitute
Francesco Cavaliere retweeted
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
🎉
authors.elsevier.com/sd/arti…
Happy to share the last evolution of FILO designed to solve large-scale pickup and delivery problems
Francesco Cavaliere retweeted
And … dulcis in fundo, Alan Osorio defends … congrats to all candidates was a pleasure having them in bologna … to see them flying away …
Francesco Cavaliere retweeted
Or-dense phd defense session ! Now Silvia Anna Cordieri defends her thesis on optimization for multi
Energy systems …
Francesco Cavaliere retweeted
*Trained Random Forests Completely Reveal your Dataset!* arxiv.org/abs/2402.19232v1
#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)
Francesco Cavaliere retweeted
#UrobORosDEI Easter dinner @DPalasgo, @FrnCava, @dominiqs81, and Roberto Roberti (@MFischetti, you were missed!) #orms
Francesco Cavaliere retweeted
#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
Francesco Cavaliere retweeted
#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
Francesco Cavaliere retweeted
#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 retweeted
authors.elsevier.com/c/1iXkb…
Very excited to share my last joint effort with Luca accorsi to push forward the frontier of large scale routing optimization.
Francesco Cavaliere retweeted
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?
youtu.be/x7fxeNqSK2k
#cpp #cplusplus #cpp20
Francesco Cavaliere retweeted
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++!
Francesco Cavaliere retweeted
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.
Happy to share the video of the presentation about my initial work on a VRP heuristics framework, at the @DIMACSChallenge Workshop.
It sure has been a great experience, full of exciting people and insightful presentations.
youtu.be/_BuVm8extuQ