The SCIP 10 optimization suite has many new interesting features and is fully open source. For binaries and downloads, check www.scipopt.org/index.php#do...

Is there a rule of thumb for how to split research content between a conference paper and its extended journal version, while respecting overlap limits and without it looking like holding back material?

The 2026 Land-Doig Competition is open! This year’s topic is GPU-Accelerated Primal Heuristics for Mixed-Integer Programming. Details below. www.mixedinteger.org/2026/competi...

Writing is hard — and it should be @davidbessis.bsky.social

Krunal explores different optimization strategies for this year’s IMO P6, a combinatorial tiling problem with tricky coverage constraints. Worth a look!

Multiple AI systems won gold medals at the 2025 International Mathematical Olympiad (IMO). Exciting as that sounds, @GregHBurnham argues that it represents little progress: an unlucky draw of problems made the event relatively uninformative. Is that cope? Judge for yourself. 🧵

This is about one of my greatest inspirations. It would mean a lot to me if you gave it a watch

This story of the discovery of Alison Doig the person is wild pursuit.unimelb.edu.au/articles/cel...

Slides for #EuroMIP25 are online!

Graph theorist Maria Chudnovsky proved the strong perfect graph theorem, which was proposed back in the 1960s. Tune in to “The Joy of Why” with co-host @jannalevinastro.bsky.social:

And that's a wrap on #EuroMIP25! Three packed days of great talks and inspiring research. Huge thanks to @sophie.huiberts.me , @matbesancon.bsky.social, the rest of the MIP committee and the local team for making this first edition a real success!

Lucas Létocart’s wraps up with a dive into Decomposition Methods for Quadratic Programming problems, both convex and non-convex. #EuroMIP25 #orms

Stefan Kuhlmann’s talk focused on Sparse Integer Solutions and Approximations. This is an important topic both theoretically and in applications where nonzero entries can represent costly decisions or changes. #EuroMIP25 #orms

Sophie Demassey @sofdem.bsky.social kicks off the third and final day of #EuroMIP25 with a talk on Block Coordination of Nonlinear Network and Discrete Optimization. She focuses on scheduling nonlinear flow networks, with an application to load shifting in drinking water systems. #EuroMIP25 #orms

François Lamothe explores strengthening linear relaxations for MIPs by combining Dantzig-Wolfe and Fenchel decompositions. #EuroMIP25 #orms

Laurent Poirrier dives into the engineering side of the simplex method (with slides that speak for themselves). He starts from the standard form of LPs and outlines the usual solving techniques: simplex, interior point, and first-order methods.

Yelena Yuditsky presents recent advances on solving special classes of integer programs with bounded subdeterminants. #EuroMIP25 #orms

Johannes Thurauf presents joint work with Martin Schmidt on an Exact Method for Nonlinear Network Flow Interdiction Problems, modeled as max–min bilevel programs with nonconvex, nonlinear flow constraints on the follower side. #EuroMIP25 #orms

Leona Gottwald talks about which components are truly necessary for delivering good performance in modern MIP solvers, drawing from her development experience of HiGHS (and others). #EuroMIP25 #orms

Fabio Furini talks about Hidden Bilevel Structures in Graph Disconnection Problems, focusing on the capacitated vertex separator and the k-vertex cut. Both are reformulated as Stackelberg games: a leader deletes vertices and a follower optimizes over the disconnected graph. #euroMIP25 #orms

Monique Laurent opens the second day of #EuroMIP25 with a presentation on Semidefinite approximations for bicliques and biindependent pairs. The focus is on measures involving the size and balance of independent sets in bipartite graphs such as their sum or product. #EuroMIP25 #orms

Frédéric Didier presents the MIP-related aspects of Google’s CP-SAT solver, with a focus on how linear relaxations, cuts, and presolve are integrated into a framework originally designed for pure integer problems. #EuroMIP25 #orms

Veronica Piccialli tackles the challenge of computing strong bounds for large-scale Minimum Sum-of-Squares Clustering (MSSC). She begins by highlighting the importance of global optimality, as heuristic solutions like k-means can lead to misleading interpretations.

Meike Neuwohner presents a characterization of total unimodularity for disjoint hypergraphs, , i.e. hypergraphs whose hyperedges of size at least four are pairwise disjoint. #EuroMIP25 #orms

Elina Rönnberg presents a method to accelerate branch-and-price by directly targeting integrality in the column generation (CG) phase.

Alexandra Lassota presents an overview of how Integer Programming meets Fixed-Parameter Tractability (FPT), showing how structural parameters can make hard problems tractable.

Johannes Thürauf presents work on robust network design for systems with nonconvex flows taking into account demand uncertainties. The goal is to ensure feasible operation under all load scenarios within a defined uncertainty set, where injections and withdrawals vary freely. #EuroMIP25 #orms

Nadia Brauner opens the #EuroMIP25 workshop with a talk on the need to integrate environmental and societal issues into Operations Research. She argues that optimization must go beyond cost and efficiency to reflect real-world consequences. Two examples illustrate this: #EuroMIP25 #orms

Jan Kronqvist announces at the #mip2025 workshop that the MIP Competition will be from now on known as the Land-Doig MIP Competition. The winners this year are a team from the Zuse Institute Berlin, represented by Gioni Mexi, who presents their approach based on branch-and-bound with Frank-Wolfe.

CALL FOR POSTERS: At the MIP Workshop Europe we will host a poster session. Submissions from all career stages are welcome. Poster deadline: April 14! Workshop: July 1-3

While mathematicians have succeeded in showing the irrationality of some numbers, such as π and 𝘦, for most other numbers it remains frustratingly hard to prove. But a new method is now allowing mathematicians to do so for a slew of important numbers.

New video! Terence Tao on how we measure the cosmos: youtu.be/YdOXS_9_P4U

How would you count the number of different words in Hamlet? Computer scientists have come up with a simple and efficient way to do it, using randomness.

registration for the 2025 school on column generation is now open www.gerad.ca/colloques/Co... #orms

A new proof marks the first progress in decades on important cases of the “kissing spheres” problem. 😚 @gregbarber.bsky.social reports: www.quantamagazine.org/mathematicia...

3. The EURO Young Forum remains free to join, and we warmly invite you to be part of our growing network. To join, simply fill out our registration form docs.google.com/forms/d/e/1F... Also, stay connected through our Slack channel and Google Group! (4/5)

Save the date! The 2025 Mixed Integer Programming Workshop will be held June 3–6, 2025 at the University of Minnesota in Minneapolis, MN. #mip2025 features a wonderful single-track program, poster session, and computational competition. Stay tuned for more details. www.mixedinteger.org/2025/ #orms

There have been several remarkable developments in combinatorics, my field of mathematics. A few weeks ago I gave a talk to a general mathematical audience in which I described six breakthroughs from the last five years. www.youtube.com/watch?v=726O...