4 papers
LeJOT: An Intelligent Job Cost Orchestration Solution for Databricks Platform
Lizhi Ma, Yi-Xiang Hu, Yuke Wang +5
With the rapid advancements in big data technologies, the Databricks platform has become a cornerstone for enterprises and research institutions, offering high computational effici…
CLCR: Contrastive Learning-based Constraint Reordering for Efficient MILP Solving
Shuli Zeng, Mengjie Zhou, Sijia Zhang +3
Constraint ordering plays a critical role in the efficiency of Mixed-Integer Linear Programming (MILP) solvers, particularly for large-scale problems where poorly ordered constrain…
Beyond Local Selection: Global Cut Selection for Enhanced Mixed-Integer Programming
Shuli Zeng, Sijia Zhang, Shaoang Li +2
In mixed-integer programming (MIP) solvers, cutting planes are essential for Branch-and-Cut (B&C) algorithms as they reduce the search space and accelerate the solving process. Tra…
FFCG: Effective and Fast Family Column Generation for Solving Large-Scale Linear Program
Yi-Xiang Hu, Feng Wu, Shaoang Li +2
Column Generation (CG) is an effective and iterative algorithm to solve large-scale linear programs (LP). During each CG iteration, new columns are added to improve the solution of…