Kai Hoppmann-Baum

Mathemagician, researcher at ZIB and TUB

[Kai Hoppmann-Baum @boppmannkai]

@schmaidt @timoberthold @MattMilten @gurobi Here comes the #BaronOfBilevel again... :D © @JeffLinderoth

[Kai Hoppmann-Baum @boppmannkai]

@timoberthold @GOR_ev_ Sounds like a breakup, @timoberthold. I thought we were just getting serious!

Thanks for all you help on this journey. I'm deeply grateful.

[Kai Hoppmann-Baum @boppmannkai]

@schmaidt @timoberthold @GOR_ev_ You had the honor to read it ;-). No but seriously, thanks again that you did it!

[Kai Hoppmann-Baum @boppmannkai]

@schmaidt There is a typo in the first bullet point! ;-)

[Kai Hoppmann-Baum @boppmannkai]

@timoberthold @JeffLinderoth @ambrosgleixner @Roghayeh_hz Fantastic. <3

[Kai Hoppmann-Baum @boppmannkai]

@schmaidt @JeffLinderoth Since when is @timoberthold doing bilevel stuff?

[Kai Hoppmann-Baum @boppmannkai]

@WayneSchlegel_ Peter Neururer

[Kai Hoppmann-Baum @boppmannkai]

@MickyBeisenherz The Two Masketeers

[Kai Hoppmann-Baum @boppmannkai]

@ILjubic @schmaidt @essec Is the rainbow-slide-style on purpose? Maybe even related to a big upcoming sport event?

[Kai Hoppmann-Baum @boppmannkai]

@GerritKloss @Wortify_ Welche beiden haben am Ende gefehlt?

[Kai Hoppmann-Baum @boppmannkai]

@AustinLBuchanan I instantly hear the guitar riff...

[Kai Hoppmann-Baum @boppmannkai]

@mluebbecke @timoberthold @FICO_Xpress Pseudocosts

[Kai Hoppmann-Baum @boppmannkai]

@timoberthold @FICO_Xpress @gurobi

[Kai Hoppmann-Baum @boppmannkai]

@mluebbecke @schmaidt @thkleinert @sarcasticshivi Fühl ich.

[Kai Hoppmann-Baum @boppmannkai]

@TedRalphs @schmaidt Thanks, @TedRalphs! Hope you are doing well.

[Kai Hoppmann-Baum @boppmannkai]

#optimization #orms #tsp #mip

[Kai Hoppmann-Baum @boppmannkai]

If you like TSP-style problems, you might wanna check out our new paper on the Length-Constrained Cycle Partition Problem (LCCP), a novel generalization of the TSP, which has just been published in OMS: https://t.co/vjAK6ivPg6

[Kai Hoppmann-Baum @boppmannkai]

As the formatiing process was rather difficult, I recommend you download the paper as pdf as this version is actually in a very nice format.

[Kai Hoppmann-Baum @boppmannkai]

@RobertCSchwarz Exactly. It means that each vertex is contained in exactly one cycle. And the goal is to minimize the number of necessary cycles, i.e., the size of the cover. LCCP is somewhat related to VRP, but also different. There is a discussion on this in the paper ;-)