{"total":12,"rows":[{"id":"2407.13954","title":"Neural topology optimization: the good, the bad, and the ugly","created":"2024-07-19","cited_by_count":10,"area":null},{"id":"2406.13125","title":"A Unified Framework for Combinatorial Optimization Based on Graph Neural Networks","created":"2024-06-19","cited_by_count":5,"area":null},{"id":"2602.00549","title":"Beyond the Node: Clade-level Selection for Efficient MCTS in Automatic Heuristic Design","created":"2026-01-31","cited_by_count":2,"area":null},{"id":"2504.11885","title":"HyperSAT: Unsupervised Hypergraph Neural Networks for Weighted MaxSAT Problems","created":"2025-04-16","cited_by_count":1,"area":null},{"id":"2505.19497","title":"Learning for Dynamic Combinatorial Optimization without Training Data","created":"2025-05-26","cited_by_count":1,"area":null},{"id":"2511.17435","title":"Multi-Agent Pointer Transformer: Seq-to-Seq Reinforcement Learning for Multi-Vehicle Dynamic Pickup-Delivery Problems","created":"2025-11-21","cited_by_count":1,"area":null},{"id":"2505.20997","title":"BIPNN: Learning to Solve Binary Integer Programming via Hypergraph Neural Networks","created":"2025-05-27","cited_by_count":0,"area":null},{"id":"2601.21048","title":"Test-Time Adaptation for Unsupervised Combinatorial Optimization","created":"2026-01-28","cited_by_count":0,"area":null},{"id":"2603.06260","title":"Learning to Solve Orienteering Problem with Time Windows and Variable Profits","created":"2026-03-06","cited_by_count":0,"area":null},{"id":"2603.19318","title":"Towards Solving Polynomial-Objective Integer Programming with Hypergraph Neural Networks","created":"2026-03-16","cited_by_count":0,"area":null},{"id":"2604.21961","title":"A general optimization solver based on OP-to-MaxSAT reduction","created":"2026-04-23","cited_by_count":0,"area":null},{"id":"2605.19721","title":"Projecting Latent RL Actions: Towards Generalizable and Scalable Graph Combinatorial Optimization","created":"2026-05-19","cited_by_count":0,"area":null}],"next_cursor":null}