{"total":15,"rows":[{"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":"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":"2301.03377","title":"Machine Learning for Large-Scale Optimization in 6G Wireless Networks","created":"2023-01-03","cited_by_count":18,"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":"2406.09740","title":"Deep Symbolic Optimization for Combinatorial Optimization: Accelerating Node Selection by Discovering Potential Heuristics","created":"2024-06-14","cited_by_count":8,"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":"2312.14836","title":"Learning Lagrangian Multipliers for the Travelling Salesman Problem","created":"2023-12-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":"2401.09556","title":"Deep learning enhanced mixed integer optimization: Learning to reduce model dimensionality","created":"2024-01-17","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":"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":"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":"2604.00094","title":"Speeding Up Mixed-Integer Programming Solvers with Sparse Learning for Branching","created":"2026-03-31","cited_by_count":0,"area":null}],"next_cursor":null}