← 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

Structured Convolutional Kernel Networks for Airline Crew Scheduling ICML 2021
Multi-layered Network Exploration via Random Walks: From Offline Optimization to Online Learning ICML 2021
Efficient Message Passing for 0–1 ILPs with Binary Decision Diagrams ICML 2021
Local Correlation Clustering with Asymmetric Classification Errors ICML 2021
The Power of Adaptivity for Stochastic Submodular Cover ICML 2021
Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity ICML 2021
Improved CP-Based Lagrangian Relaxation Approach with an Application to the TSP IJCAI 2021
Learning Hard Optimization Problems: A Data Generation Perspective NIPS 2021
Pure Exploration and Regret Minimization in Matching Bandits ICML 2021
Combining Reinforcement Learning with Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problem AAAI 2021
CombOptNet: Fit the Right NP-Hard Problem by Learning Integer Programming Constraints ICML 2021
Decomposable Submodular Function Minimization via Maximum Flow ICML 2021
Adaptive Experimental Design for Optimizing Combinatorial Structures IJCAI 2021
Reformulating DOVER-Lap Label Mapping as a Graph Partitioning Problem INTERSPEECH 2021
Automatic Design of Heuristic Algorithms for Binary Optimization Problems IJCAI 2021
Improved Acyclicity Reasoning for Bayesian Network Structure Learning with Constraint Programming IJCAI 2021
Reinforcement Learning for Route Optimization with Robustness Guarantees IJCAI 2021
Graph Edit Distance Learning via Modeling Optimum Matchings with Constraints IJCAI 2021
Beyond Perturbation Stability: LP Recovery Guarantees for MAP Inference on Noisy Stable Instances AISTATS 2021
Adaptive Sampling for Fast Constrained Maximization of Submodular Functions AISTATS 2021
Symbolic Regression via Deep Reinforcement Learning Enhanced Genetic Programming Seeding NIPS 2021
Maximizing Agreements for Ranking, Clustering and Hierarchical Clustering via MAX-CUT AISTATS 2021
Contrastive Losses and Solution Caching for Predict-and-Optimize IJCAI 2021
Unconstrained MAP Inference, Exponentiated Determinantal Point Processes, and Exponential Inapproximability AISTATS 2021
A Fast Exact Algorithm for the Resource Constrained Shortest Path Problem AAAI 2021