{"total":38,"rows":[{"id":"2302.01129","title":"De Novo Molecular Generation via Connection-aware Motif Mining","created":"2023-02-02","cited_by_count":46,"area":null},{"id":"2410.08288","title":"Towards Foundation Models for Mixed Integer Linear Programming","created":"2024-10-10","cited_by_count":31,"area":null},{"id":"2402.05501","title":"Machine Learning Augmented Branch and Bound for Mixed Integer Linear Programming","created":"2024-02-08","cited_by_count":24,"area":null},{"id":"2310.02807","title":"A Deep Instance Generative Framework for MILP Solvers Under Limited Data Availability","created":"2023-10-04","cited_by_count":21,"area":null},{"id":"2302.09166","title":"Machine Learning for Cutting Planes in Integer Programming: A Survey","created":"2023-02-17","cited_by_count":20,"area":null},{"id":"2410.22806","title":"MILP-StuDio: MILP Instance Generation via Block Structure Decomposition","created":"2024-10-30","cited_by_count":17,"area":null},{"id":"2503.01129","title":"Apollo-MILP: An Alternating Prediction-Correction Neural Solving Framework for Mixed-Integer Linear Programming","created":"2025-03-03","cited_by_count":16,"area":null},{"id":"2311.05650","title":"Learning to Configure Separators in Branch-and-Cut","created":"2023-11-08","cited_by_count":14,"area":null},{"id":"2310.14161","title":"Promoting Generalization for Exact Solvers via Adversarial Instance Augmentation","created":"2023-10-22","cited_by_count":12,"area":null},{"id":"2402.07099","title":"Rethinking the Capacity of Graph Neural Networks for Branching Strategy","created":"2024-02-11","cited_by_count":12,"area":null},{"id":"2404.12638","title":"Learning to Cut via Hierarchical Sequence/Set Model for Efficient Mixed-Integer Programming","created":"2024-04-19","cited_by_count":12,"area":null},{"id":"2401.17527","title":"Learning to Stop Cut Generation for Efficient Mixed-Integer Linear Programming","created":"2024-01-31","cited_by_count":8,"area":null},{"id":"2410.11061","title":"Learning to Optimize for Mixed-Integer Non-linear Programming with Feasibility Guarantees","created":"2024-10-14","cited_by_count":8,"area":null},{"id":"2412.12038","title":"LLMs for Cold-Start Cutting Plane Separator Configuration","created":"2024-12-16","cited_by_count":8,"area":null},{"id":"2506.21364","title":"CA-I2P: Channel-Adaptive Registration Network with Global Optimal Selection","created":"2025-06-26","cited_by_count":8,"area":null},{"id":"2508.11850","title":"EvoCut: Strengthening Integer Programs via Evolution-Guided Language Models","created":"2025-08-16","cited_by_count":8,"area":null},{"id":"2310.11845","title":"Accelerate Presolve in Large-Scale Linear Programming via Reinforcement Learning","created":"2023-10-18","cited_by_count":7,"area":null},{"id":"2401.05960","title":"Machine Learning Insides OptVerse AI Solver: Design Principles and Applications","created":"2024-01-11","cited_by_count":7,"area":null},{"id":"2502.15791","title":"Learning-Guided Rolling Horizon Optimization for Long-Horizon Flexible Job-Shop Scheduling","created":"2025-02-18","cited_by_count":7,"area":null},{"id":"2406.18781","title":"Learning to Remove Cuts in Integer Linear Programming","created":"2024-06-26","cited_by_count":4,"area":null},{"id":"2511.09209","title":"CoCo-MILP: Inter-Variable Contrastive and Intra-Constraint Competitive MILP Solution Prediction","created":"2025-11-12","cited_by_count":4,"area":null},{"id":"2407.03125","title":"Foundations and Frontiers of Graph Learning Theory","created":"2024-07-03","cited_by_count":3,"area":null},{"id":"2502.19693","title":"Accurate and Scalable Graph Neural Networks via Message Invariance","created":"2025-02-27","cited_by_count":3,"area":null},{"id":"2506.11057","title":"STRCMP: Integrating Graph Structural Priors with Language Models for Combinatorial Optimization","created":"2025-05-22","cited_by_count":3,"area":null},{"id":"2503.15847","title":"Beyond Local Selection: Global Cut Selection for Enhanced Mixed-Integer Programming","created":"2025-03-20","cited_by_count":2,"area":null},{"id":"2504.03688","title":"CLCR: Contrastive Learning-based Constraint Reordering for Efficient MILP Solving","created":"2025-03-23","cited_by_count":2,"area":null},{"id":"2405.16409","title":"Network Interdiction Goes Neural","created":"2024-05-26","cited_by_count":1,"area":null},{"id":"2505.11526","title":"Code Retrieval for MILP Instance Generation","created":"2025-05-11","cited_by_count":1,"area":null},{"id":"2607.18252","title":"MILP-Evo: Closed-Loop Fully Automatic Design of MILP Solvers","created":"2026-05-12","cited_by_count":1,"area":null},{"id":"2307.08816","title":"Accelerating Cutting-Plane Algorithms via Reinforcement Learning Surrogates","created":"2023-07-17","cited_by_count":0,"area":null},{"id":"2310.14659","title":"Predicting Accurate Lagrangian Multipliers for Mixed Integer Linear Programs","created":"2023-10-23","cited_by_count":0,"area":null},{"id":"2508.16611","title":"Quantum-Inspired DRL Approach with LSTM and OU Noise for Cut Order Planning Optimization","created":"2025-08-13","cited_by_count":0,"area":null},{"id":"2509.15828","title":"HyP-ASO: A Hybrid Policy-based Adaptive Search Optimization Framework for Large-Scale Integer Linear Programs","created":"2025-09-19","cited_by_count":0,"area":null},{"id":"2510.19348","title":"A Markov Decision Process for Variable Selection in Branch & Bound","created":"2025-10-22","cited_by_count":0,"area":null},{"id":"2605.29366","title":"Solving Integer Linear Programming with Parallel Tempering","created":"2026-05-28","cited_by_count":0,"area":null},{"id":"2608.25282","title":"SHSP: Structure-Aware Hierarchical Solution Prediction for Mixed-Integer Linear Programming","created":"2026-08-26","cited_by_count":0,"area":null},{"id":"2609.36735","title":"BiFE: Search-Efficient Discovery of CPU-Only Branching Policies via LLM-based Bi-Fidelity Evolution","created":"2026-09-29","cited_by_count":0,"area":null},{"id":"2610.00730","title":"Reformulation-Contrastive Learning for Mixed Integer Programs","created":"2026-09-30","cited_by_count":0,"area":null}],"next_cursor":null}