Added the market split session

Author: k-sidorov

_bibliography/s20250414.bib

@@ -0,0 +1,30 @@
+@InProceedings{10.1007/3-540-69346-7_22,
+author="Cornu{\'e}jols, G{\'e}rard
+and Dawande, Milind",
+editor="Bixby, Robert E.
+and Boyd, E. Andrew
+and R{\'i}os-Mercado, Roger Z.",
+title="A Class of Hard Small 0---1 Programs",
+html="https://link.springer.com/chapter/10.1007/3-540-69346-7_22",
+booktitle="Integer Programming and Combinatorial Optimization",
+year="1998",
+publisher="Springer Berlin Heidelberg",
+address="Berlin, Heidelberg",
+pages="284--293",
+abstract="In this paper, we consider a class of 0--1 programs which, although innocent looking, is a challenge for existing solution methods. Solving even small instances from this class is extremely difficult for conventional branch-and-bound or branch-and-cut algorithms. We also experimented with basis reduction algorithms and with dynamic pro- gramming without much success. The paper then examines the perfor- mance of two other methods: a group relaxation for 0,1 programs, and a sorting-based procedure following an idea of Wolsey. Although the re- sults with these two methods are somewhat better than with the other four when it comes to checking feasibility, we offer this class of small 0,1 programs as a challenge to the research community. As of yet, instances from this class with as few as seven constraints and sixty 0--1 variables are unsolved.",
+isbn="978-3-540-69346-8"
+}
+
+@article{Trick2003,
+  volume = {118},
+  ISSN = {0254-5330},
+  url = {http://dx.doi.org/10.1023/A:1021801522545},
+  html = {http://dx.doi.org/10.1023/A:1021801522545},
+  DOI = {10.1023/a:1021801522545},
+  number = {1/4},
+  journal = {Annals of Operations Research},
+  publisher = {Springer Science and Business Media LLC},
+  author = {Trick,  Michael A.},
+  year = {2003},
+  pages = {73–84}
+}

_sessions/2025-04-14-market-split.md

@@ -0,0 +1,11 @@
+---
+layout: session
+title: A Class of Hard Small 0—1 Programs
+host: Konstantin Sidorov
+host_ref: https://ksidorov.nl
+session_type: paper
+related_papers: s20250414
+---
+
+In this session, I will show a class of binary linear programming problems that poses major difficulties to branch-and-cut solvers. We will also discuss the developments induced by this observation, as market split instances have proven helpful
+ both for the MIP theory (suggesting a study of lattice-based approaches) and for dynamic programming techniques.