{"total":32,"rows":[{"id":"2302.00244","title":"Learning Cut Selection for Mixed-Integer Linear Programming via Hierarchical Sequence Model","created":"2023-02-01","cited_by_count":45,"area":null},{"id":"2202.10962","title":"Adaptive Cut Selection in Mixed-Integer Linear Programming","created":"2022-02-22","cited_by_count":26,"area":null},{"id":"2206.07886","title":"Generalization Bounds for Data-Driven Numerical Linear Algebra","created":"2022-06-16","cited_by_count":24,"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":"2302.09166","title":"Machine Learning for Cutting Planes in Integer Programming: A Survey","created":"2023-02-17","cited_by_count":20,"area":null},{"id":"2204.07312","title":"Structural Analysis of Branch-and-Cut and the Learnability of Gomory Mixed Integer Cuts","created":"2022-04-15","cited_by_count":19,"area":null},{"id":"2207.10199","title":"Provably tuning the ElasticNet across instances","created":"2022-07-20","cited_by_count":14,"area":null},{"id":"2111.11207","title":"Improved Sample Complexity Bounds for Branch-and-Cut","created":"2021-11-18","cited_by_count":13,"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":"2204.03569","title":"Accelerating ERM for data-driven algorithm design using output-sensitive techniques","created":"2022-04-07","cited_by_count":8,"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":"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":"2205.09963","title":"Sample Complexity of Learning Heuristic Functions for Greedy-Best-First and A* Search","created":"2022-05-20","cited_by_count":6,"area":null},{"id":"2209.08281","title":"Improved Generalization Bound and Learning of Sparsity Patterns for Data-Driven Low-Rank Approximation","created":"2022-09-17","cited_by_count":5,"area":null},{"id":"2405.13992","title":"Learning Cut Generating Functions for Integer Programming","created":"2024-05-22","cited_by_count":5,"area":null},{"id":"2212.07231","title":"Cutting Plane Selection with Analytic Centers and Multiregression","created":"2022-12-14","cited_by_count":4,"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":"2405.15911","title":"Learning accurate and interpretable tree-based models","created":"2024-05-24","cited_by_count":3,"area":null},{"id":"2310.19920","title":"Solving a Class of Cut-Generating Linear Programs via Machine Learning","created":"2023-10-30","cited_by_count":2,"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":"2509.22626","title":"Learning Admissible Heuristics for A*: Theory and Practice","created":"2025-09-26","cited_by_count":2,"area":null},{"id":"2602.02406","title":"Provably Data-driven Multiple Hyper-parameter Tuning with Structured Loss Function","created":"2026-02-02","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":"2506.00252","title":"How hard is learning to cut? Trade-offs and sample complexity","created":"2025-05-30","cited_by_count":1,"area":null},{"id":"2602.02505","title":"Learning-augmented smooth integer programs with PAC-learnable oracles","created":"2026-01-22","cited_by_count":1,"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":"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":"2606.08638","title":"Parameter Tuning with Generalization Guarantees for GPU-Accelerated Linear Programming","created":"2026-06-07","cited_by_count":0,"area":null}],"next_cursor":null}