milp

The paper introduces MILP-Evo, a closed-loop framework that uses LLM-guided program evolution to automatically design white-box MILP solver components (cut selectors and branching rules) by iteratively generating and evaluating candidate programs via end-to-end solver performance on MILP instances.

This paper presents LP Mining with LP2Graph, a method that extracts and taxonomizes LP and MILP formulations from the literature into a reproducible dataset using typed variable-equation graphs, demonstrated on railway rescheduling.

Reverse engineering the Qualcomm NPU compiler reveals undocumented VTCM memory management, MILP-based placement, automatic precision alteration, and a hidden analytical simulator (Hextimate) for edge deployment optimization.

Position paper arguing for a post-solve robustness layer for MILP decision engines, formalizing feasible neighborhoods and solution smoothness under perturbations, and calling for certified inner approximations and adversarial robustness margins.