{"total":23,"rows":[{"id":"2102.09544","title":"Combinatorial optimization and reasoning with graph neural networks","created":"2021-02-18","cited_by_count":268,"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":"2210.16934","title":"Learning to Compare Nodes in Branch and Bound with Graph Neural Networks","created":"2022-10-30","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":"2205.14345","title":"Reinforcement Learning for Branch-and-Bound Optimisation using Retrospective Trajectories","created":"2022-05-28","cited_by_count":20,"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":"2401.03244","title":"Artificial Intelligence for Operations Research: Revolutionizing the Operations Research Process","created":"2024-01-06","cited_by_count":11,"area":null},{"id":"2111.06257","title":"Branch and Bound in Mixed Integer Linear Programming Problems: A Survey of Techniques and Trends","created":"2021-11-05","cited_by_count":9,"area":null},{"id":"2304.03755","title":"Online Learning for Scheduling MIP Heuristics","created":"2023-04-04","cited_by_count":6,"area":null},{"id":"2310.00112","title":"Reinforcement Learning for Node Selection in Branch-and-Bound","created":"2023-09-29","cited_by_count":4,"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":"2211.12581","title":"UNSAT Solver Synthesis via Monte Carlo Forest Search","created":"2022-11-22","cited_by_count":3,"area":null},{"id":"2102.02125","title":"Generative deep learning for decision making in gas networks","created":"2021-02-03","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":"2511.21107","title":"Dynamic Stratified Contrastive Learning with Upstream Augmentation for MILP Branching","created":"2025-11-26","cited_by_count":1,"area":null},{"id":"2308.12680","title":"Master-slave Deep Architecture for Top-K Multi-armed Bandits with Non-linear Bandit Feedback and Diversity Constraints","created":"2023-08-24","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":"2510.19348","title":"A Markov Decision Process for Variable Selection in Branch & Bound","created":"2025-10-22","cited_by_count":0,"area":null},{"id":"2602.14772","title":"Learning Structural Hardness for Combinatorial Auctions: Instance-Dependent Algorithm Selection via Graph Neural Networks","created":"2026-02-16","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":"2610.14835","title":"Sequence-Structured Decision Learning for Branch-and-Bound in Mixed-Integer Linear Programming","created":"2026-10-10","cited_by_count":0,"area":null}],"next_cursor":null}