← Keywords

combinatorial optimization

1039 papers

Explore in graph

Also known as

CUCB COP CO

Co-occurring keywords

approximation algorithm (630) graph neural network (3945) multi-armed bandit (1091) regret bound (1918) graph algorithm (177) neural network (6616) reinforcement learning (4122) submodular optimization (261) graph theory (249) discrete optimization (145)

Papers

DualOpt: A Dual Divide-and-Optimize Algorithm for the Large-scale Traveling Salesman Problem AAAI 2025
Searching for and Avoiding Hidden Sets Using Queries with Local Feedback AAAI 2025
Neural Combinatorial Clustered Bandits for Recommendation Systems AAAI 2025
Efficient Algorithms for Electing Successive Committees IJCAI 2025
Differentiable Adversarial Attacks for Marked Temporal Point Processes AAAI 2025
A Weighted-Based Fast Local Search for α-Neighbor p-Center Problem IJCAI 2025
An Elite-guided Weighted Simulated Annealing Algorithm for the Clique Partitioning Problem AAAI 2025
Learning Optimal Oblique Decision Trees with (Max)SAT IJCAI 2025
EFX Feasible Scheduling for Time-dependent Resources IJCAI 2025
An Efficient Core-Guided Solver for Weighted Partial MaxSAT IJCAI 2025
Fully-Scalable Massively Parallel Algorithm for k-center with Outliers AAAI 2025
Fair and Welfare-Efficient Constrained Multi-Matchings under Uncertainty NIPS 2024
COMBHelper: A Neural Approach to Reduce Search Space for Graph Combinatorial Problems AAAI 2024
Couples Can Be Tractable: New Algorithms and Hardness Results for the Hospitals/Residents Problem with Couples IJCAI 2024
Multi-Winner Reconfiguration NIPS 2024
Unveiling the Lexical Sensitivity of LLMs: Combinatorial Optimization for Prompt Enhancement EMNLP 2024
Benchmarking PtO and PnO Methods in the Predictive Combinatorial Optimization Regime NIPS 2024
Rethinking Parity Check Enhanced Symmetry-Preserving Ansatz NIPS 2024
Linear-Time Optimal Deadlock Detection for Efficient Scheduling in Multi-Track Railway Networks IJCAI 2024
No-Regret M${}^{\natural}$-Concave Function Maximization: Stochastic Bandit Algorithms and NP-Hardness of Adversarial Full-Information Setting NIPS 2024
Accelerating ERM for data-driven algorithm design using output-sensitive techniques NIPS 2024
Clustering with Non-adaptive Subset Queries NIPS 2024
SequentialAttention++ for Block Sparsification: Differentiable Pruning Meets Combinatorial Optimization NIPS 2024
Warm-starting Push-Relabel NIPS 2024
Controlling Continuous Relaxation for Combinatorial Optimization NIPS 2024