The 25th Conference on Integer Programming and Combinatorial Optimization
Program
General information
The following is the detailed program of the conference, including an assignment of speakers into slots. We will try to maintain the order as given, but there can be circumstances where the schedule still might need changes. Please contact us at ipcoconf2024 (at) gmail (dot) com if you are a speaker and absolutely cannot present at the assigned slot.
More information will appear on this page as they become available.
The conference talks as well as the summer school lectures are planned to take place at:
Institute of Computer Science, University of Wrocław
Joliot-Curie 15, 50-383 Wrocław, Poland
The summer school lectures (Monday – Tuesday) will take place in room 119 of the institute.
The IPCO 2024 conference starts with a welcome reception and a poster session on Tuesday, July 2, at 18:30. The reception will take place in the ground floor lobby of the institute.
We encourage the participants to visit the registration desk (ground floor of the Institute) preferably on Monday 8:00 – 9:00, Tuesday 18:00 – 19:00, or Wednesday 7:45 – 8:45.
The IPCO 2024 presentations of accepted papers (Wednesday – Friday) will take place in room 25 of the institute.
The second poster session will take place on Wednesday at 12:45 – 13:45 on the 1st floor of the institute, near the lunch break area.
Lunches and coffee breaks are provided to registered participants as part of the registration fee.
Morning coffee will be available starting 8 am every day of the conference.
You may either go there yourself or join the crowd that will start walking towards the restaurant around 18:00 from the Institute.
Please wear your conference badge when going to the restaurant.
The list of all accepted posters can be found below. The presenters of the posters are expected to put up their posters around 18:30 on Tuesday.
Detailed program
Monday, July 1
8:50 – 9:00
Summer school opening
9:00 – 10:30
Lecture by Sophie Huiberts
10:30 – 11:00
Coffee break
11:00 – 12:30
Lecture by Neil Olver
12:45 – 13:45
Lunch break
14:00 – 15:30
Lecture by Vera Traub
15:30 – 16:00
Coffee break
16:00 – 17:30
Exercise session
Tuesday, July 2
9:00 – 10:30
Lecture by Sophie Huiberts
10:30 – 11:00
Coffee break
11:00 – 12:30
Lecture by Neil Olver
12:45 – 13:45
Lunch break
14:00 – 15:30
Lecture by Vera Traub
15:30 – 16:00
Coffee break
16:00 – 17:30
Open problem session
18:30 – 20:30
IPCO 2024 welcome reception and poster sessionLocation: ground floor lobby of the institute.
Wednesday, July 3
8:45 – 9:00
Conference opening
9:00 – 9:25
Gérard Cornuéjols, Siyue Liu and R. Ravi. Approximately Packing Dijoins via Nowhere-Zero Flows
9:30 – 9:55
Aditya Anand and Euiwoong Lee. Separating k-Median from the Supplier Version
10:00 – 10:25
Rajni Dabas, Naveen Garg and Neelima Gupta. Capacitated Facility Location with Outliers and Uniform Facility Costs
10:30 – 11:00
Coffee break
11:00 – 11:25
Sally Dong and Thomas Rothvoss. Extension Complexity of Polytopes with Bounded Integral Slack Matrices
11:30 – 11:55
Christoph Hunkenschröder, Kim-Manuel Klein, Martin Koutecký, Alexandra Lassota and Asaf Levin. Tight Lower Bounds for Block-Structured Integer Programs
12:00 – 12:25
Iskander Aliev, Marcel Celaya and Martin Henk. Sparsity and integrality gap transference bounds for integer programs
12:45 – 13:45
Lunch break / Poster session
14:00 – 14:25
Jamico Schade, Makrand Sinha and Stefan Weltge. Lower Bounds on the Complexity of Mixed-Integer Programs for Stable Set and Knapsack
14:30 – 14:55
Marcel Celaya, Stefan Kuhlmann and Robert Weismantel. On Matrices over a Polynomial Ring with Restricted Subdeterminants
15:00 – 15:25
Yongchun Li and Weijun Xie. On the Partial Convexification of the Low-Rank Spectral Optimization: Rank Bounds and Algorithms
Richard Cole, Christoph Hertrich, Yixin Tao and László Végh. A First Order Method for Linear Programming Parameterized by Circuit Imbalance
16:30 – 16:55
Kirill Kukharenko and Laura Sanità. On the Number of Degenerate Simplex Pivots
17:00 – 17:25
Jannik Matuschke. Decomposing Probability Marginals Beyond Affine Requirements
18:30 – 20:30
IPCO 2024 conference dinner
Friday, July 5
9:00 – 9:25
Javier Marinkovic, José A. Soto and Victor Verdugo. Online Combinatorial Assignment in Independence Systems
9:30 – 9:55
Omar El Housni, Andrea Lodi and Theo Barre. Assortment Optimization with Visibility Constraints
10:00 – 10:25
Ayoub Foussoul, Vineet Goyal and Amit Kumar. Fully-Dynamic Load Balancing
10:30 – 11:00
Coffee break
11:00 – 11:25
Chien-Chung Huang, Nidia Obscura Acosta and Sorrachai Yingchareonthawornchai. An FPTAS for Connectivity Interdiction
11:30 – 11:55
Meike Neuwohner. A 4/3-approximation for the Maximum Leaf Spanning Arborescence problem in dags
12:00 – 12:25
Zeev Nutov. Extending the primal-dual 2-approximation algorithm beyond uncrossable set families
12:45 – 13:45
Lunch break
14:00 – 14:25
Jesus De Loera, Brittney Marsters, Luze Xu and Shixuan Zhang. Integer Points in Arbitrary Convex Cones: The Case of the PSD and SOC Cones
14:30 – 14:55
Emily Schutte and Matthias Walter. Relaxation strength for multilinear optimization: McCormick strikes back
15:00 – 15:25
Jingye Xu, Santanu Dey and Diego Cifuentes. Sensitivity analysis for mixed binary quadratic programming
Accepted posters
General information on the poster session: IPCO 2024 will feature an informal poster session during which participants will have the opportunity to present their research on the topics related to the scope of the conference. As the poster session is an informal part of IPCO, it may include posters that have been recently presented at other venues. The list of the posters can be found below, but it will not be included in the official proceedings of IPCO.
Sophia Heimann, Hung Hoang and Stefan Hougardy. The k-Opt algorithm for the Traveling Salesman Problem has exponential running time for k ≥ 5.
Robert Ganian, Hung Hoang and Simon Wietheger. Parameterized Complexity of Efficient Sortation.
Susanne Armbruster, Matthias Mnich and Martin Nägele. A (3/2+1/e)-Approximation Algorithm for Ordered TSP.
Barbara Fiedorowicz. Strategies for Identifying Damaged Edges in Resistive Electrical Networks.
Christian Nöbel and Raphael Steiner. Hardness of computing (different notions of) diameters of polytopes.
Ambrogio Maria Bernardelli. Lower bounds for the Integrality Gap of the Metric Steiner Tree Problem via a novel formulation.
Gabor Riccardi. A Parallel Algorithm for Large-Scale Capacity Expansion Models of the Power Grid.
Jannis Blauth, Meike Neuwohner, Luise Puhlmann and Jens Vygen. Improved guarantees for the a priori TSP.
Sabrina C.L. Ammann, Birte Ostermann, Sebastian Stiller and Timo de Wolff. A Speed-up for Helsgaun’s TSP Heuristic by Relaxing the Positive Gain Criterion.
Fabien Nießen and Paul Paschmanns. Days On Days Off Scheduling Problem (DODOSP).
Fateme Abbasi. Parameterized Approximation for Robust Clustering in Discrete Geometric Spaces.
Fateme Abbasi, Marek Adamczyk, Miguel Bosch-Calvo, Jarosław Byrka, Fabrizio Grandoni, Krzysztof Sornat, Antoine Tinguely. An O(log log n)-Approximation for Submodular Facility Location.