{"total":17,"rows":[{"id":"2206.14987","title":"Lookback for Learning to Branch","created":"2022-06-30","cited_by_count":27,"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":"2412.18529","title":"Accelerating process control and optimization via machine learning: A review","created":"2024-12-24","cited_by_count":5,"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":"2412.09444","title":"Search Strategy Generation for Branch and Bound Using Genetic Programming","created":"2024-12-12","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":"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":"2211.02466","title":"Network Aware Compute and Memory Allocation in Optically Composable Data Centres with Deep Reinforcement Learning and Graph Neural Networks","created":"2022-10-26","cited_by_count":0,"area":null},{"id":"2301.13799","title":"Partitioning Distributed Compute Jobs with Reinforcement Learning and Graph Neural Networks","created":"2023-01-31","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":"2510.19348","title":"A Markov Decision Process for Variable Selection in Branch & Bound","created":"2025-10-22","cited_by_count":0,"area":null},{"id":"2601.16056","title":"Designing faster mixed integer linear programming algorithm via learning the optimal path","created":"2026-01-22","cited_by_count":0,"area":null},{"id":"2610.00730","title":"Reformulation-Contrastive Learning for Mixed Integer Programs","created":"2026-09-30","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}