Bebês

Do please feel very welcome to attend our upcoming meeting where, besides a speech, we've got a TT planned that you would *hate* to miss. No really, you'd absolutely *HATE* to not participate in this one. But I can't say anymore without spoiling it 😜, except that we'd *love* to have you join us and wish you the *LOVE*liest of times. Toastmasters Club Sarajevo at 18:30 CEST, 26 May, at Društveni centar Općine Centar, Muhameda Kantardžića 3. Zoom is also totally an option - just message us for the link.

JOINING THE EVENT Please join the event through the Sketchy Collective international group. The Sarajevo sub-group is temporary and was created to make our group more visible to people in Sarajevo. You can find the link to the same event in the international group here: https://www.meetup.com/sketchy-collective-international/events/314735747/?eventOrigin=group_events_list HOW TO FIND US The location will be announced soon. Feel free to send us recommendations for venues that you think would be suitable for our meetups. \*\*\* HOW IT WORKS At each meetup, attendees take turns modeling for quick 10-minute sketch sessions. One person poses while everyone else sketches, then we rotate. \*\*\* WHAT TO BRING Pencils and paper (or any sketching tools you prefer). \*\*\* No fees, no pressure. The only thing we ask is that everyone takes a turn posing for the group. You can sit in whatever position feels comfortable - the 10 minutes go by quickly! Draw as much as you like, skip a round if you’re tired or just want to chat, and leave whenever it suits you. The event continues as long as there’s interest. \*\*\* STAYING CONNECTED We have a WhatsApp group for staying in touch and sharing updates. Ask the organizer to add you to the WhatsApp group during the meetup.

Combinatorial optimization problems arise across logistics, scheduling, and engineering, and C++ remains a language of choice when performance matters. This lecture takes a practical look at solving such problems in C++, using the Electric Vehicle Routing Problem as a running example. We begin with an exact solver, formulating the problem as a mixed-integer program and trying to solve it through GLPK's C API directly from C++. Exact methods, however, quickly hit their limits on real-world instances. The second half of the talk turns to metaheuristics: how they are designed, why C++ is particularly well suited for implementing them, and what design choices matter most in practice. We'll walk through a concrete implementation, touching on data structures for fast neighborhood evaluation, generic algorithm design with templates, and the performance considerations that separate a prototype from a production-ready solver. The goal is not to advocate for one approach over another, but to show how C++ supports the full spectrum of optimization techniques. # About Speaker Luka Matijević is a researcher at the Mathematical Institute of the Serbian Academy of Sciences and Arts, whose work bridges academic research and freelance engineering. He's drawn to identifying the right algorithm for a given problem — and to the kind of careful optimization captured by one of his favourite Futurama lines: *"When you do things right, people won't be sure you've done anything at all."* ## 📅 Event Details | | | | --- | --- | | 👤 **Speaker** | **[Luka Matijević](https://www.linkedin.com/in/luka-matijevic/)** | | 🕕 **Date & Time** | **27th of May (Wednesday), 6 pm** | | 📍 **Location** | **Beograđanka, Vidikovac, 22nd floor** | | 🏢 **Address** | **Masarikova 5** | | 💻 **Online** | **[C++ Serbia YouTube](https://www.youtube.com/@cppserbia)** | See you!