Mixed Integer
Mixed-integer programming (MIP) focuses on optimization problems involving both continuous and discrete variables, aiming to find optimal solutions within constraints. Current research emphasizes improving the efficiency and scalability of MIP solvers, particularly for large-scale problems, through techniques like integrating machine learning models (e.g., neural networks, transformers) to accelerate solution finding and improve cut selection strategies within branch-and-bound algorithms. These advancements have significant implications for various fields, including robotics, logistics, and machine learning itself, by enabling the solution of previously intractable optimization problems and enhancing the performance of data-driven methods.
Papers
Graph-based Reinforcement Learning meets Mixed Integer Programs: An application to 3D robot assembly discovery
Niklas Funk, Svenja Menzenbach, Georgia Chalvatzaki, Jan Peters
Towards Safe and Efficient Swarm-Human Collaboration: A Hierarchical Multi-Agent Pickup and Delivery framework
Xin Gong, Tieniu Wang, Yukang Cui, Tingwen Huang