{"total":36,"rows":[{"id":"2102.09544","title":"Combinatorial optimization and reasoning with graph neural networks","created":"2021-02-18","cited_by_count":268,"area":null},{"id":"2306.17100","title":"RL4CO: an Extensive Reinforcement Learning for Combinatorial Optimization Benchmark","created":"2023-06-29","cited_by_count":71,"area":null},{"id":"2406.15007","title":"RouteFinder: Towards Foundation Models for Vehicle Routing Problems","created":"2024-06-21","cited_by_count":55,"area":null},{"id":"2205.11107","title":"Learning to branch with Tree MDPs","created":"2022-05-23","cited_by_count":45,"area":null},{"id":"2203.02878","title":"A Survey for Solving Mixed Integer Programming via Machine Learning","created":"2022-03-06","cited_by_count":44,"area":null},{"id":"2203.02433","title":"The Machine Learning for Combinatorial Optimization Competition (ML4CO): Results and Insights","created":"2022-03-04","cited_by_count":39,"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":"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":"2205.14345","title":"Reinforcement Learning for Branch-and-Bound Optimisation using Retrospective Trajectories","created":"2022-05-28","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":"2406.06954","title":"Distributional MIPLIB: a Multi-Domain Library for Advancing ML-Guided MILP Methods","created":"2024-06-11","cited_by_count":15,"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":"2206.06965","title":"Deep Reinforcement Learning for Exact Combinatorial Optimization: Learning to Branch","created":"2022-06-14","cited_by_count":12,"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":"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":"2205.11638","title":"DOGE-Train: Discrete Optimization on GPU with End-to-end Training","created":"2022-05-23","cited_by_count":6,"area":null},{"id":"2307.00670","title":"Automatic MILP Solver Configuration By Learning Problem Similarities","created":"2023-07-02","cited_by_count":5,"area":null},{"id":"2605.10401","title":"LLM4Branch: Large Language Model for Discovering Efficient Branching Policies of Integer Programs","created":"2026-05-11","cited_by_count":4,"area":null},{"id":"2311.13843","title":"Exact Combinatorial Optimization with Temporo-Attentional Graph Neural Networks","created":"2023-11-23","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":"2505.24779","title":"Are Your Generated Instances Truly Useful? GenBench-MILP: A Benchmark Suite for MILP Instance Generation","created":"2025-05-30","cited_by_count":2,"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":"2405.16409","title":"Network Interdiction Goes Neural","created":"2024-05-26","cited_by_count":1,"area":null},{"id":"2512.09355","title":"Branching Strategies Based on Subgraph GNNs: A Study on Theoretical Promise versus Practical Reality","created":"2025-12-10","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":"2310.09986","title":"On Statistical Learning of Branch and Bound for Vehicle Routing Optimization","created":"2023-10-15","cited_by_count":0,"area":null},{"id":"2409.06559","title":"Learn2Aggregate: Supervised Generation of Chv\\'atal-Gomory Cuts Using Graph Neural Networks","created":"2024-09-10","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":"2603.24033","title":"SRG: Score-based Relaxation-guided Generation for Mixed Integer Linear Programming","created":"2026-03-25","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":"2607.06532","title":"GraphBU: MILP Instance Generation with Graph-Native Block Units","created":"2026-07-07","cited_by_count":0,"area":null},{"id":"2607.17570","title":"A Weisfeiler-Leman Characterization of Global-Attention Graph Transformers for Mixed-Integer Linear Programs","created":"2026-07-20","cited_by_count":0,"area":null},{"id":"2609.37356","title":"Teaching LLMs to Generate Challenging MILP Instances via Solver Feedback","created":"2026-09-29","cited_by_count":0,"area":null}],"next_cursor":null}