Co-occurring keywords · papers mentioning both
Papers
Fine-Grained Search Space Classification for Hard Enumeration Variants of Subset Problems
AAAI 2019
Generalized Distance Bribery
AAAI 2019
Generative Adversarial User Model for Reinforcement Learning Based Recommendation System
ICML 2019
Greedy Maximization of Functions with Bounded Curvature under Partition Matroid Constraints
AAAI 2019
Heuristic Search Algorithm for Dimensionality Reduction Optimally Combining Feature Selection and Feature Extraction
AAAI 2019
Improved Regret Bounds for Bandit Combinatorial Optimization
NeurIPS 2019
Improving Optimization Bounds Using Machine Learning: Decision Diagrams Meet Deep Reinforcement Learning
AAAI 2019
Integrating Pseudo-Boolean Constraint Reasoning in Multi-Objective Evolutionary Algorithms
IJCAI 2019
Interlaced Greedy Algorithm for Maximization of Submodular Functions in Nearly Linear Time
NeurIPS 2019
K-Core Maximization: An Edge Addition Approach
IJCAI 2019
KerGM: Kernelized Graph Matching
NeurIPS 2019
Learning Optimal Classification Trees Using a Binary Linear Program Formulation
AAAI 2019
Learning to Order Graph Elements with Application to Multilingual Surface Realization
EMNLP 2019
Learning to Perform Local Rewriting for Combinatorial Optimization
NeurIPS 2019
Learning to Screen
NeurIPS 2019
Learning to Solve NP-Complete Problems: A Graph Neural Network for Decision TSP
AAAI 2019
Long-Distance Dependencies Don’t Have to Be Long: Simplifying through Provably (Approximately) Optimal Permutations
ACL 2019
Low-Rank Semidefinite Programming for the MAX2SAT Problem
AAAI 2019
Making the Cut: A Bandit-based Approach to Tiered Interviewing
NeurIPS 2019
Matching with Constraints
IJCAI 2019
Matroid Constrained Fair Allocation Problem
AAAI 2019
MaxHedge: Maximizing a Maximum Online
AISTATS 2019
Melding the Data-Decisions Pipeline: Decision-Focused Learning for Combinatorial Optimization
AAAI 2019
Minimizing Time-to-Rank: A Learning and Recommendation Approach
IJCAI 2019
On the Problem of Assigning PhD Grants
IJCAI 2019