Separating these and some additional constraints is easy and the resulting branch-and-cut approach was competitive versus state-of-the-art approaches, especially if k is large. The approach also generalizes to various other problems where graphs should be disconnected.

Interpreting the problem as a game between a leader who has to remove vertices and a follower that connects the remaining graph, eventually the following formulation results. It contains only constraints that enforce a removal of vertices such that the remaining graph has at least k components.

The naive integer programm is not so great - weak LP relaxation and highly symmetric

In the k-vertex cut problem, the goal is to select as few vertices as possible such that the remaining graph consists of at least k connected components

Lunch seminar at the Center of Algorithmics and Optimization (RWTH Aachen): Fabio Furini held a talk about Graph Disconnection Games

My main gripe with typst, touying (=beamer) and fletcher was the integration, i.e., if you want to build or modify a drawing over multiple slides. There at least for me it is less intuitive than beamers only/visible and the shitty workarounds i used increased the otherwise fast typst compile speed

I have done a few versions of my recent talk in Typst and generally i think it looks great. I have used fletchers for graph drawings and its also nice until you want to do something it doesnt really support natively, and then it was painful. For tikz atleast you can always find a stackoverflow post

Its the small wrench on the top right, but i am on mobile only rn. Pretty sure i have downloaded bibtex citations from at least some Informa Journals before, but it always is a pain to find (luckily zotero does that for me nowadays)

Maybe i misunderstand, but isn't this what you ask?

If only there were some high-quality videos teaching it ;)

Imaging having the answer before you start implementing :)

The master in Bielefeld

I remember when I presented GCG 3.0 at the MIP conference in 2018, today Erik Mühmer introduces the new features of the next version

#orms #or2025

**Please repost** If you're enjoying Paper Skygest -- our personalized feed of academic content on Bluesky -- we'd appreciate you reposting this! We’ve found that the most effective way for us to reach new users and communities is through users sharing it with their network

Is there a recording of the John Company session?

Tom Lehrer made all of his music 100% public domain so if seeing people sad about his death makes you want to check them out… it’s free. he wanted you to share them.

tomlehrersongs.com

Presentation by David Treviño about Humanitarian Logistics at Doctors Without Borders today, organized by Lorena Reyes Rubiano at the Chair of Data and Business Analytics @ RWTH Aachen

For those interested in Benders decomposition (one of my favorite topics), check this paper by Kaiwen Fang, Inho Sin, and (the amazing) Geunyeong Byeon

arxiv.org/abs/2506.03561

Journal article (based on a talk) from 1966, could replace a few words and post on Linkedin as is

I had a look at the linked white paper and they first determine eligible machines and then assign the job to the machine with the highest score. And their new approach found a better scoring function which seems reasonably easy to understand.

Arc-Based Dynamic Discretization Discovery for Continuous-Time Service Network Design by @ahelber.bsky.social

#orms optimization-online.org/2025/04/arc-...

Yesterday we heard that our grant to help federal agencies become more effective and efficient at identifying and stopping labor trafficking has been terminated, effective immediately, with no reason other than it not aligning with current federal priorities . 🧵

Looking forward to testing these algorithms to solve LPs. Can we expect Gurobi to open source some of its algorithms in the future as well?

Curious how quickly the swine are implementing Project 2025? Be curious no longer!! It's all being tracked right here:

www.project2025.observer

#bluecrew #proudblue #resist #project2025