← 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

Improving Local Search for Minimum Weight Vertex Cover by Dynamic Strategies IJCAI 2018
(Probably) Concave Graph Matching NIPS 2018
Combinatorial Optimization with Graph Convolutional Networks and Guided Tree Search NIPS 2018
Compiling Combinatorial Prediction Games ICML 2018
A Fast Algorithm for Optimally Finding Partially Disjoint Shortest Paths IJCAI 2018
Preference Orders on Families of Sets - When Can Impossibility Results Be Avoided? IJCAI 2018
Multi-objective Maximization of Monotone Submodular Functions with Cardinality Constraint NIPS 2018
Bayesian Optimization of Combinatorial Structures ICML 2018
Linear Satisfiability Preserving Assignments (Extended Abstract) IJCAI 2018
Partial Optimality and Fast Lower Bounds for Weighted Correlation Clustering ICML 2018
Weakly Submodular Maximization Beyond Cardinality Constraints: Does Randomization Help Greedy? ICML 2018
Combinatorial Semi-Bandits with Knapsacks AISTATS 2018
Contextual Combinatorial Multi-armed Bandits with Volatile Arms and Submodular Reward NIPS 2018
DS*: Tighter Lifting-Free Convex Relaxations for Quadratic Matching Problems CVPR 2018
Bringing Multi-agent Path Finding Closer to Reality IJCAI 2018
Compact-MDD: Efficiently Filtering (s)MDD Constraints with Reversible Sparse Bit-sets IJCAI 2018
Learning to Branch ICML 2018
The Cluster Description Problem - Complexity Results, Formulations and Approximations NIPS 2018
Learning to Optimize Combinatorial Functions ICML 2018
Adversarial Attack on Graph Structured Data ICML 2018
Winning a Tournament by Any Means Necessary IJCAI 2018
Joint Cuts and Matching of Partitions in One Graph CVPR 2018
Stochastic Anytime Search for Bounding Marginal MAP IJCAI 2018
Combinatorial Penalties: Which structures are preserved by convex relaxations? AISTATS 2018
An Optimization Approach to Learning Falling Rule Lists AISTATS 2018