Marouane Felloussi
@marouanefl.bsky.social
phd candidate in discrete optimization at mines st-étienne/univ. clermont auvergne
https://marouane-f.github.io
https://marouane-f.github.io
Pinned
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!
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!
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?
October 28, 2025 at 3:42 PM
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...
www.mixedinteger.org/2026/competi...
MIPcc26: The 2026 Land-Doig MIP Competition
www.mixedinteger.org
October 20, 2025 at 4:02 PM
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...
www.mixedinteger.org/2026/competi...
Writing is hard — and it should be
The excruciating art of clarifying your mind
open.substack.com
September 16, 2025 at 11:21 AM
Krunal explores different optimization strategies for this year’s IMO P6, a combinatorial tiling problem with tricky coverage constraints.
Worth a look!
Worth a look!
Optimization models for IMO 2025 P6
YouTube video by Krunal Patel
youtu.be
September 5, 2025 at 6:13 AM
Krunal explores different optimization strategies for this year’s IMO P6, a combinatorial tiling problem with tricky coverage constraints.
Worth a look!
Worth a look!
Reposted by Marouane Felloussi
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. 🧵
@GregHBurnham
argues that it represents little progress: an unlucky draw of problems made the event relatively uninformative.
Is that cope? Judge for yourself. 🧵
August 11, 2025 at 4:14 PM
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. 🧵
@GregHBurnham
argues that it represents little progress: an unlucky draw of problems made the event relatively uninformative.
Is that cope? Judge for yourself. 🧵
Reposted by Marouane Felloussi
This is about one of my greatest inspirations. It would mean a lot to me if you gave it a watch
Lessons from Paula Harris / by Sophie Huiberts
YouTube video by Mixed Integer Programming
www.youtube.com
August 11, 2025 at 11:06 AM
This is about one of my greatest inspirations. It would mean a lot to me if you gave it a watch
Reposted by Marouane Felloussi
July 27, 2025 at 2:07 PM
Reposted by Marouane Felloussi
Slides for #EuroMIP25 are online!
Mixed Integer Programming Workshop 2024
www.mixedinteger.org
July 21, 2025 at 2:38 PM
Slides for #EuroMIP25 are online!
Reposted by Marouane Felloussi
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:
How Does Graph Theory Shape Our World? | Quanta Magazine
Maria Chudnovsky reflects on her journey in graph theory, her groundbreaking solution to the long-standing perfect graph problem, and the unexpected ways this abstract field intersects with everyday…
www.quantamagazine.org
July 4, 2025 at 12:07 PM
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!
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!
July 3, 2025 at 4:22 PM
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!
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
#EuroMIP25 #orms
July 3, 2025 at 3:55 PM
Lucas Létocart’s wraps up with a dive into Decomposition Methods for Quadratic Programming problems, both convex and non-convex.
#EuroMIP25 #orms
#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
#EuroMIP25 #orms
July 3, 2025 at 3:39 PM
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
#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
#EuroMIP25 #orms
July 3, 2025 at 3:11 PM
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
#EuroMIP25 #orms
François Lamothe explores strengthening linear relaxations for MIPs by combining Dantzig-Wolfe and Fenchel decompositions.
#EuroMIP25 #orms
#EuroMIP25 #orms
July 3, 2025 at 12:02 AM
François Lamothe explores strengthening linear relaxations for MIPs by combining Dantzig-Wolfe and Fenchel decompositions.
#EuroMIP25 #orms
#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.
July 2, 2025 at 11:45 PM
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
#EuroMIP25 #orms
July 2, 2025 at 11:26 PM
Yelena Yuditsky presents recent advances on solving special classes of integer programs with bounded subdeterminants.
#EuroMIP25 #orms
#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
#EuroMIP25 #orms
July 2, 2025 at 3:59 PM
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
#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
#EuroMIP25 #orms
July 2, 2025 at 3:29 PM
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
#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
#euroMIP25 #orms
July 2, 2025 at 1:26 PM
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
#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
#EuroMIP25 #orms
July 2, 2025 at 1:12 PM
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
#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
#EuroMIP25 #orms
July 1, 2025 at 8:34 PM
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
#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.
July 1, 2025 at 7:58 PM
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
#EuroMIP25 #orms
July 1, 2025 at 7:27 PM
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
#EuroMIP25 #orms
Elina Rönnberg presents a method to accelerate branch-and-price by directly targeting integrality in the column generation (CG) phase.
July 1, 2025 at 3:56 PM
Elina Rönnberg presents a method to accelerate branch-and-price by directly targeting integrality in the column generation (CG) phase.