✨ New abstract submission deadline!!

The 6th EUROYoung Workshop - Lugano 2026 This is the site made for showing activities and opportunities for early career researchers in operations research.

⚠️ EUROYoung Workshop's deadline is approaching!

📝 Submit your abstract by April 15 to join us in Lugano, CH, October 14–16, 2026!

✨ Join us for three days of operations research and networking among young researchers!

🎉 Plenary speakers announced on our website: euroyoung.eu/lugano2026/

Registration is now open!

The 6th EUROYoung Workshop - Lugano 2026 This is the site made for showing activities and opportunities for early career researchers in operations research.

📢 Abstract submission for the EUROYoung Workshop 2026 in Lugano (CH) opens soon!

📅 Workshop: 14–16 October 2026
📝 Abstracts: 10 March – 15 April 2026

Join young researchers in OR for talks, networking & social events.

💻 euroyoung.eu/lugano2026
📧 euroyoung2026@usi-supsi.ch

@euroyoung.bsky.social

Great news today: our group will have two contributions at #ISCO2026! 🎉

1️⃣ A regular paper, where we study the complexity of falsifying heuristics

2️⃣ An extended abstract on the TSP integrality gap (4/3 for LP solutions with ≤ n+6 nonzeros).

👨‍🏫👨‍🏫 Don’t miss the talks of our amazing PhD students!

The 6th EUROYoung Workshop - Lugano 2026 This is the site made for showing activities and opportunities for early career researchers in operations research.

The 6th #EUROYoungWorkshop is coming to #Lugano, Switzerland 🇨🇭| Oct 14-16, 2026

Join us for 3 days of talks, networking & social events—inspiring plenaries and lakeside charm await!

Abstract submission: 10 Mar – 15 Apr
Registration: 1 May – 1 Jun

🔗 euroyoung.eu/lugano2026

😍 Our paper "The Integrality Gap of the TSP is 4/3 if the LP Solution Has at Most n+6 Non-zero Components" has been accepted to #IPCO2026!

We attack this problem using a novel and general approach that works even beyond the half-integral case!

📄 Our paper is available: arxiv.org/abs/2507.07003

📚 New Arxiv Paper

Title: The Cloven Traveling Salesman: Cycle Covers and the Integrality Gap of Small ATSP Instances
Authors: Alessandro Sosso, Ambrogio Maria Bernardelli, Stefano Gualandi

Read more: https://arxiv.org/abs/2511.05045

✨ We show the integrality gap for the symmetric TSP is ≤ 4/3 when the LP solution has ≤ n+6 nonzeros.

💻 After a careful study of the TSP polytope, we reduce the problem to finitely many cases and analyze them one by one in a computer-aided proof fashion.

📄 Read more here: arxiv.org/abs/2507.07003

✨ Our paper "On the integrality gap of small Asymmetric Traveling Salesman Problems" has been accepted in Discrete Optimization! 🎉

We proved new lower bounds on the integrality gap of ATSP on a given dimension. We also release small, hard-to-solve ATSP instances!

Check out: lnkd.in/dVEWYGnD

✨ DEADLINE in 4 days!! ✨

Last, Tullio is presenting new insight on the 4/3 conjecture for the metric Traveling Salesman Problem 🤩

Koppány follows by presenting our ICALP ‘25 paper on interpreting branch and bound as PTAS, showing the importance of node selection and lower bound for make this type of algorithms very efficient, even in practice!

From our group, Stefano starts by presenting how hard is to find counterexamples for heuristics from the perspective of a theoretical computer scientist

Mini-workshop on “Algorithms, Optimization and Complexity” organized by the OC Group ( #IDSIA ) with Professor Klaus Jansen as invited speaker and short talks from IDSIA researchers!

oc.idsia.ch

📢 Deadline extended!
Submit to the volume “Shaping a Sustainable Future in the Era of Big Data” — Deadline: June 15, 2025.

📝 Open primarily to PhD students and young PostDocs, but submissions are welcome from all interested authors!

💰 Best Paper Award!

🔗 meteor.springer.com/9thairoyoung...

✨ Excited to share that I’ll be giving a contributed talk titled "The Limits of Exact Solvers: Hard Instances for the Travelling Salesperson Problem" at the Women in Mathematics Conference at #EPFL!

I am so happy to contribute to such an inspiring event!

The extended version of our #ICALP2025 paper is now online!

We try to partially bridge this gap by showing that, given certain rules for node selection, branching and bounding branch-and-bound algorithms *are* polynomial time approximation schemes!

🔗 arxiv.org/abs/2504.15885

📄 Submissions are now open for the proceeding "Shaping a Sustainable Future in the Era of Big Data"—a Scopus-indexed proceedings volume following the #AYW9 😍

🏆 Best Paper Award sponsored by SEA Vision & ARGO Vision

🔗 All the info here equinocs.springernature.com/service/9tha...
📅 Deadline May 31st

Spending the night coding with the research group to build the website for the Optimization and Complexity group at #IDSIA ✨

✨ Excited to announce that the 9th AIROYoung workshop will have a proceeding, with me on the editorial board!

📝 This is open to PhD students, postdocs, and young professionals who attended, as well as other interested authors.

⏳ More info soon: equinocs.springernature.com/service/9tha...

Last day to send your contribution! 🙏🏻

AIROYoung 2025 - Pavia AIROYoung Workshop 2025

The abstract submission deadline for the 9th AIROYoung Workshop: "Shaping a Sustainable Future in the Era of Big Data" is now extended to January 10, 2025! 📅

🏆 Prizes:

Fedegari Best Poster Prize
OPTIT "OR in Practice" Presentation Prize
Submit your work & join us! 🌟

mate.unipv.it/ayw2025/

I will soon be opening a call for a postdoctoral position in online learning and algorithmic game theory, starting in 2025, funded by my ERC at Bocconi University.

If you're interested, feel free to reach out. If you're not personally interested but know someone who might be, please let them know!

Registration for #AYW2025 is now open! You can join and present your research in OR through a talk or a poster

📅 Deadline: Jan 3

Two awards will recognize high-quality contributions:
- OPTIT "OR in Practice" Presentation Prize
- Best Poster Prize

mate.unipv.it/ayw2025/

The TSP formulation of Dantzig, Fulkerson, and Johnson works so well despite having exponentially many subtour elimination constraints (SEC). Why? Researchers have observed that only a handful of SECs are needed in practice. Can this be exploited?

📯📯📯 Registration is now open for the 9th AIRO Young Workshop: "Shaping a Sustainable Future in the Era of Big Data" . Don’t miss out! Secure your spot today!

#ORMS

mate.unipv.it/ayw2025/#reg...

First Bluesky post just to announce the

🎺 9th AIROYoung Workshop 🎺

that I am co-organizing in Pavia!

Don't miss the opportunity to be part of it!

To visit the event webpage:
🔗https://mate.unipv.it/ayw2025/