{"total":19,"rows":[{"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":"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":"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":"2409.04367","title":"Algorithm Configuration for Structured Pfaffian Settings","created":"2024-09-06","cited_by_count":11,"area":null},{"id":"2309.00203","title":"Generalization Bound and Learning Methods for Data-Driven Projections in Linear Programming","created":"2023-09-01","cited_by_count":10,"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":"2401.05960","title":"Machine Learning Insides OptVerse AI Solver: Design Principles and Applications","created":"2024-01-11","cited_by_count":7,"area":null},{"id":"2402.02328","title":"Sample Complexity of Algorithm Selection Using Neural Networks and Its Applications to Branch-and-Cut","created":"2024-02-04","cited_by_count":7,"area":null},{"id":"2405.13992","title":"Learning Cut Generating Functions for Integer Programming","created":"2024-05-22","cited_by_count":5,"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":"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":"2507.05084","title":"Distribution-dependent Generalization Bounds for Tuning Linear Regression Across Tasks","created":"2025-07-07","cited_by_count":2,"area":null},{"id":"2605.19052","title":"Provably Data-driven Lagrangian Relaxation for Mixed Integer Linear Programming","created":"2026-05-18","cited_by_count":2,"area":null},{"id":"2305.12352","title":"Data-driven Mixed Integer Optimization through Probabilistic Multi-variable Branching","created":"2023-05-21","cited_by_count":1,"area":null},{"id":"2406.08687","title":"AlphaZeroES: Direct score maximization outperforms planning loss minimization","created":"2024-06-12","cited_by_count":0,"area":null},{"id":"2505.11636","title":"Generalization Guarantees for Learning Branch-and-Cut Policies in Integer Programming","created":"2025-05-16","cited_by_count":0,"area":null},{"id":"2601.20203","title":"Minimum-Cost Network Flow with Dual Predictions","created":"2026-01-28","cited_by_count":0,"area":null},{"id":"2606.08638","title":"Parameter Tuning with Generalization Guarantees for GPU-Accelerated Linear Programming","created":"2026-06-07","cited_by_count":0,"area":null},{"id":"2608.17343","title":"Tight Bounds for Data-driven Multiple Hyper-parameter Tuning with Structured Loss Function","created":"2026-08-18","cited_by_count":0,"area":null}],"next_cursor":null}