🔥Telegram İfşa

Want to watch Sean Baxter'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

Happy to share the video of the presentation about my initial work on a VRP heuristics framework, at the DIMACS VRP Challenge Workshop. It sure has been a great experience, full of exciting people and insightful presentations. youtu.be/_BuVm8extuQ

T-mo B-hold 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.

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++!

authors.elsevier.com/c/1iXkb15N8SQ~… Very excited to share my last joint effort with Luca accorsi to push forward the frontier of large scale routing optimization.

#8AYW #Day2 #PlenaryLecture The second keynote speaker is Prof. daniele vigo (Università di Bologna), who presents different heuristic approaches developed with several former Ph.D. students (among which Luca Accorsi and Francesco Cavaliere) to solve Vehicle Routing Problems #orms 1/n

#8AYW #Day2 #Logistics Dario Palasgo 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

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

#8AYW #Day3 #DynamicUncertainOptimization Alice Raffaele 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

#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

*Trained Random Forests Completely Reveal your Dataset!* arxiv.org/abs/2402.19232… #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)

#UrobORosDEI Easter dinner Dario Palasgo, Francesco Cavaliere, Domenico Salvagnin, and Roberto Roberti (Matteo Fischetti, you were missed!) #orms

Francesco cavaliere is defending today his phd thesis !!!

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

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

🎉

After the #reading_group of today, we decided to study Gino Sorbillo Pizza’s #pineapple pizza—but the younger ones weren't brave enough… Dario Palasgo Federico Michelotto Francesco Cavaliere Matteo Fischetti Domenico Salvagnin Roberto Roberti Alice Raffaele

A special mug to Alice Raffaele from Subject to #euro24

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

Subject to: Timo Berthold (FICO & TU Berlin), youtu.be/z-c7OMtClmY, #orms #optimization #Analytics #MIP T-mo B-hold FICO (Fair Isaac) FICO Xpress Optimization TU Berlin Zuse Institute Berlin