Skip to content
conftrace_

combinatorial optimization

1,103 papers

CO

Papers

EFX Feasible Scheduling for Time-dependent Resources IJCAI 2025 Eliminating Majority Illusion Is Easy AAAI 2025 Epistemic EFX Allocations Exist for Monotone Valuations AAAI 2025 ERL-MPP: Evolutionary Reinforcement Learning with Multi-head Puzzle Perception for Solving Large-scale Jigsaw Puzzles of Eroded Gaps AAAI 2025 Expanding Connected Components from Alternative Terminals: Global Optimization for Freshwater Fishes Under the UN's 30x30 Conservation Goal IJCAI 2025 Fully-Scalable Massively Parallel Algorithm for k-center with Outliers AAAI 2025 GAP: a Global Adaptive Pruning Method for Large Language Models EMNLP 2025 GFPack++: Attention-Driven Gradient Fields for Optimizing 2D Irregular Packing ICCV 2025 GOAL: A Generalist Combinatorial Optimization Agent Learner ICLR 2025 How Many Lines to Paint the City: Exact Edge-Cover in Temporal Graphs AAAI 2025 HSEvo: Elevating Automatic Heuristic Design with Diversity-Driven Harmony Search and Genetic Algorithm Using LLMs AAAI 2025 Identifying and Reusing Learnwares Across Different Label Spaces IJCAI 2025 Improved Approximation Algorithms for Clustered TSP and Subgroup Planning AAAI 2025 Improved Fixed-Parameter Bounds for Min-Sum-Radii and Diameters k-Clustering and Their Fair Variants AAAI 2025 Improving Dialogue State Tracking through Combinatorial Search for In-Context Examples ACL 2025 Inapproximability of Optimal Multi-Agent Pathfinding Problems AAAI 2025 InfVC: An Inference-Enhanced Local Search Algorithm for the Minimum Vertex Cover Problem in Massive Graphs IJCAI 2025 JoPA: Explaining Large Language Model’s Generation via Joint Prompt Attribution ACL 2025 Large-Scale Trade-Off Curve Computation for Incentive Allocation with Cardinality and Matroid Constraints IJCAI 2025 Learn2Aggregate: Supervised Generation of Chvatal-Gomory Cuts Using Graph Neural Networks AAAI 2025 Learning-Guided Rolling Horizon Optimization for Long-Horizon Flexible Job-Shop Scheduling ICLR 2025 Learning Optimal Oblique Decision Trees with (Max)SAT IJCAI 2025 Learning to Explore and Exploit with GNNs for Unsupervised Combinatorial Optimization ICLR 2025 Learning Valid Dual Bounds in Constraint Programming: Boosted Lagrangian Decomposition with Self-Supervised Learning AAAI 2025 Logarithmic Approximations for Fair k-Set Selection IJCAI 2025