Multi-task representation learning for mixed integer linear programming

DOI10.1007/978-3-031-95973-8_9MaRDI QIDQ6899328zbMATH OpenFDO

Authors Junyang Cai, Taoan Huang, Bistra Dilkina

Publication date 14 November 2025

zbMATH Keywords

deep learningmulti-task learningmixed integer linear programminggraph neural networks

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Artificial neural networks and deep learning (68T07) Mixed integer programming (90C11)

Cites work

• A machine learning-based approximation of strong branching
• Adaptive large neighborhood search for mixed integer programming
• Automatic MILP Solver configuration by learning problem similarities
• Backdoor branching
• Backdoors to Combinatorial Optimization: Feasibility and Optimality
• Finding a Maximum Independent Set
• Getting away with more network pruning: from sparsity to geometry and linear regions
• Heuristic search viewed as path finding in a graph
• Learning pseudo-backdoors for mixed integer programs
• Mixed integer linear programming in process scheduling: modeling, algorithms, and applications
• On learning and branching: a survey
• On the hardness of approximating minimum vertex cover
• Rounding and propagation heuristics for mixed integer programming
• SMAC3: a versatile Bayesian optimization package for hyperparameter optimization
• Solving Connected Subgraph Problems in Wildlife Conservation
• Statistical mechanics of complex networks

This page was built for publication: Multi-task representation learning for mixed integer linear programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6899328)