combinatorial optimization

Boosting Dynamic Programming with Neural Networks for Solving NP-hard Problems ACML 2018 Bringing Multi-agent Path Finding Closer to Reality IJCAI 2018 Combinatorial Cost Sharing IJCAI 2018 Combinatorial Optimization with Graph Convolutional Networks and Guided Tree Search NeurIPS 2018 Combinatorial Penalties: Which structures are preserved by convex relaxations? AISTATS 2018 Combinatorial Preconditioners for Proximal Algorithms on Graphs AISTATS 2018 Combinatorial Pure Exploration with Continuous and Separable Reward Functions and Its Applications IJCAI 2018 Combinatorial Semi-Bandits with Knapsacks AISTATS 2018 Compact-MDD: Efficiently Filtering (s)MDD Constraints with Reversible Sparse Bit-sets IJCAI 2018 Compiling Combinatorial Prediction Games ICML 2018 Constrained Coalition Formation on Valuation Structures: Formal Framework, Applications, and Islands of Tractability (Extended Abstract) IJCAI 2018 Contextual Combinatorial Multi-armed Bandits with Volatile Arms and Submodular Reward NeurIPS 2018 Deep Learning of Graph Matching CVPR 2018 Distributed Pareto Optimization for Subset Selection IJCAI 2018 DS*: Tighter Lifting-Free Convex Relaxations for Quadratic Matching Problems CVPR 2018 Efficient Bandit Combinatorial Optimization Algorithm with Zero-suppressed Binary Decision Diagrams AISTATS 2018 Efficient Computation of Approximate Equilibria in Discrete Colonel Blotto Games IJCAI 2018 Efficient Projection onto the Perfect Phylogeny Model NeurIPS 2018 Experimental Design for Cost-Aware Learning of Causal Graphs NeurIPS 2018 Greed is Still Good: Maximizing Monotone Submodular+Supermodular (BP) Functions ICML 2018 Improving Local Search for Minimum Weight Vertex Cover by Dynamic Strategies IJCAI 2018 Joint Cuts and Matching of Partitions in One Graph CVPR 2018 Learning Certifiably Optimal Rule Lists for Categorical Data JMLR 2018 Learning Optimal Causal Graphs with Exact Search PGM 2018 Learning to Branch ICML 2018