@inproceedings{GhannamMexiLametal., author = {Ghannam, Mohammed and Mexi, Gioni and Lam, Edward and Gleixner, Ambros}, title = {Branch and price for the length-constrained cycle partition problem}, series = {Proceedings of INFORMS Optimization Society Conference}, booktitle = {Proceedings of INFORMS Optimization Society Conference}, language = {en} } @article{BolusaniBesanconGleixneretal., author = {Bolusani, Suresh and Besan{\c{c}}on, Mathieu and Gleixner, Ambros and Berthold, Timo and D'Ambrosio, Claudia and Mu{\~n}oz, Gonzalo and Paat, Joseph and Thomopulos, Dimitri}, title = {The MIP workshop 2023 computational competition on reoptimization}, series = {Mathematical Programming Computation}, volume = {16}, journal = {Mathematical Programming Computation}, doi = {10.1007/s12532-024-00256-w}, pages = {255 -- 266}, abstract = {This paper describes the computational challenge developed for a computational competition held in 2023 for the 20th anniversary of the Mixed Integer Programming Workshop. The topic of this competition was reoptimization, also known as warm starting, of mixed integer linear optimization problems after slight changes to the input data for a common formulation. The challenge was to accelerate the proof of optimality of the modified instances by leveraging the information from the solving processes of previously solved instances, all while creating high-quality primal solutions. Specifically, we discuss the competition's format, the creation of public and hidden datasets, and the evaluation criteria. Our goal is to establish a methodology for the generation of benchmark instances and an evaluation framework, along with benchmark datasets, to foster future research on reoptimization of mixed integer linear optimization problems.}, language = {en} } @article{CardereraBesanconPokutta, author = {Carderera, Alejandro and Besan{\c{c}}on, Mathieu and Pokutta, Sebastian}, title = {Scalable Frank-Wolfe on generalized self-concordant functions via simple steps}, series = {SIAM Journal on Optimization}, volume = {34}, journal = {SIAM Journal on Optimization}, number = {3}, doi = {10.1137/23M1616789}, language = {en} } @inproceedings{EiflerWitzigGleixner, author = {Eifler, Leon and Witzig, Jakob and Gleixner, Ambros}, title = {Branch and cut for partitioning a graph into a cycle of clusters}, series = {Combinatorial Optimization. ISCO 2024}, volume = {14594}, booktitle = {Combinatorial Optimization. ISCO 2024}, doi = {10.1007/978-3-031-60924-4_8}, abstract = {In this paper we study formulations and algorithms for the cycle clustering problem, a partitioning problem over the vertex set of a directed graph with nonnegative arc weights that is used to identify cyclic behavior in simulation data generated from nonreversible Markov state models. Here, in addition to partitioning the vertices into a set of coherent clusters, the resulting clusters must be ordered into a cycle such as to maximize the total net flow in the forward direction of the cycle. We provide a problem-specific binary programming formulation and compare it to a formulation based on the reformulation-linearization technique (RLT). We present theoretical results on the polytope associated with our custom formulation and develop primal heuristics and separation routines for both formulations. In computational experiments on simulation data from biology we find that branch and cut based on the problem-specific formulation outperforms the one based on RLT.}, language = {en} } @article{GuptaHamannMueyesseretal., author = {Gupta, Pranshu and Hamann, Fabian and M{\"u}yesser, Alp and Sgueglia, Amedeo and Parczyk, Olaf}, title = {A general approach to transversal versions of Dirac-type theorems}, series = {Bulletin of the London Mathematical Society}, journal = {Bulletin of the London Mathematical Society}, language = {en} } @article{BarrosCavalarMotaetal., author = {Barros, Gabriel F. and Cavalar, Bruno P. and Mota, Guilherme O. and Parczyk, Olaf}, title = {Anti-Ramsey threshold of cycles for sparse graphs}, series = {Discrete Applied Mathematics}, journal = {Discrete Applied Mathematics}, language = {en} } @article{KohayakawaMotaSchnitzeretal., author = {Kohayakawa, Yoshiharu and Mota, Guilherme O. and Schnitzer, Jakob and Parczyk, Olaf}, title = {Anti-Ramsey threshold of complete graphs for sparse graphs}, series = {Discrete Mathematics}, journal = {Discrete Mathematics}, language = {en} } @inproceedings{PaulsZimmerKellyetal., author = {Pauls, Jan and Zimmer, Max and Kelly, Una M and Schwartz, Martin and Saatchi, Sassan and Ciais, Philippe and Pokutta, Sebastian and Brandt, Martin and Gieseke, Fabian}, title = {Estimating canopy height at scale}, series = {Proceedings of International Conference on Machine Learning}, booktitle = {Proceedings of International Conference on Machine Learning}, language = {en} } @inproceedings{HendrychBesanconPokutta, author = {Hendrych, Deborah and Besan{\c{c}}on, Mathieu and Pokutta, Sebastian}, title = {Solving the optimal experiment design problem with mixed-integer convex methods}, series = {Proceedings of Symposium on Experimental Algorithms}, booktitle = {Proceedings of Symposium on Experimental Algorithms}, language = {en} } @article{PrauseBorndoerferGrimmetal., author = {Prause, Felix and Bornd{\"o}rfer, Ralf and Grimm, Boris and Tesch, Alexander}, title = {Approximating rolling stock rotations with integrated predictive maintenance}, series = {Journal of Rail Transport Planning \& Management}, journal = {Journal of Rail Transport Planning \& Management}, language = {en} }