Binary Linear Program

Binary linear programming (BLP) is a powerful optimization technique used to solve problems where decisions must be binary (yes/no) and satisfy a set of linear constraints. Current research focuses on improving the efficiency of BLP solvers, particularly for large-scale problems, through techniques like leveraging network flow structures and developing novel algorithms such as cone-aligned vector estimation for predict-then-optimize frameworks. BLP's versatility finds applications across diverse fields, including resource allocation (e.g., vertiport scheduling), combinatorial optimization (e.g., multicut problems), and engineering design (e.g., robotic actuation system optimization and facade reconstruction), demonstrating its significant impact on both theoretical and practical domains.