{"total":37,"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":"2302.01578","title":"Searching Large Neighborhoods for Integer Linear Programs with Contrastive Learning","created":"2023-02-03","cited_by_count":37,"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":"2206.14987","title":"Lookback for Learning to Branch","created":"2022-06-30","cited_by_count":27,"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":"2210.10759","title":"On Representing Mixed-Integer Linear Programs by Graph Neural Networks","created":"2022-10-19","cited_by_count":23,"area":null},{"id":"2406.05938","title":"Expressive Power of Graph Neural Networks for (Mixed-Integer) Quadratic Programs","created":"2024-06-09","cited_by_count":16,"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":"2505.16952","title":"FrontierCO: Real-World and Large-Scale Evaluation of Machine Learning Solvers for Combinatorial Optimization","created":"2025-05-22","cited_by_count":11,"area":null},{"id":"2306.08057","title":"Symbolic Regression via Control Variable Genetic Programming","created":"2023-05-25","cited_by_count":9,"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":"2304.03755","title":"Online Learning for Scheduling MIP Heuristics","created":"2023-04-04","cited_by_count":6,"area":null},{"id":"2212.08183","title":"Local Branching Relaxation Heuristics for Integer Linear Programs","created":"2022-12-15","cited_by_count":4,"area":null},{"id":"2502.02446","title":"Towards graph neural networks for provably solving convex optimization problems","created":"2025-02-04","cited_by_count":4,"area":null},{"id":"2211.12581","title":"UNSAT Solver Synthesis via Monte Carlo Forest Search","created":"2022-11-22","cited_by_count":3,"area":null},{"id":"2301.01913","title":"Learning a Generic Value-Selection Heuristic Inside a Constraint Programming Solver","created":"2023-01-05","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":"2312.15864","title":"BalMCTS: Balancing Objective Function and Search Nodes in MCTS for Constraint Optimization Problems","created":"2023-12-26","cited_by_count":2,"area":null},{"id":"2401.13770","title":"AlphaMapleSAT: An MCTS-based Cube-and-Conquer SAT Solver for Hard Combinatorial Problems","created":"2024-01-24","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":"2306.05905","title":"TreeDQN: Sample-Efficient Off-Policy Reinforcement Learning for Combinatorial Optimization","created":"2023-06-09","cited_by_count":1,"area":null},{"id":"2502.18483","title":"Modeling Churn in Recommender Systems with Aggregated Preferences","created":"2025-02-09","cited_by_count":1,"area":null},{"id":"2511.21107","title":"Dynamic Stratified Contrastive Learning with Upstream Augmentation for MILP Branching","created":"2025-11-26","cited_by_count":1,"area":null},{"id":"2601.04509","title":"A General Neural Backbone for Mixed-Integer Linear Optimization via Dual Attention","created":"2026-01-08","cited_by_count":1,"area":null},{"id":"2405.14741","title":"Subsampled Ensemble Can Improve Generalization Tail Exponentially","created":"2024-05-23","cited_by_count":0,"area":null},{"id":"2507.04513","title":"Churn-Aware Recommendation Planning under Aggregated Preference Feedback","created":"2025-07-06","cited_by_count":0,"area":null},{"id":"2507.23390","title":"FMIP: Joint Continuous-Integer Flow For Mixed-Integer Linear Programming","created":"2025-07-31","cited_by_count":0,"area":null},{"id":"2508.03030","title":"Collab-Solver: Collaborative Solving Policy Learning for Mixed-Integer Linear Programming","created":"2025-08-05","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":"2604.00094","title":"Speeding Up Mixed-Integer Programming Solvers with Sparse Learning for Branching","created":"2026-03-31","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":"2609.40035","title":"OPTS-TTPO: Enhancing Finite-Sample Policy-Gradient Learning with Tree Search","created":"2026-09-30","cited_by_count":0,"area":null}],"next_cursor":null}