Co-occurring keywords · papers mentioning both
Papers
Optimal Sparse Decision Trees
NeurIPS 2019
Parameterized Heuristics for Incomplete Weighted CSPs
AAAI 2019
Parsimonious Black-Box Adversarial Attacks via Efficient Combinatorial Optimization
ICML 2019
Predict+Optimise with Ranking Objectives: Exhaustively Learning Linear Functions
IJCAI 2019
Profit-driven Task Assignment in Spatial Crowdsourcing
IJCAI 2019
Randomized Strategies for Robust Combinatorial Optimization
AAAI 2019
Rotational Diversity in Multi-Cycle Assignment Problems
AAAI 2019
Scalable Robust Kidney Exchange
AAAI 2019
Separator-Based Pruned Dynamic Programming for Steiner Tree
AAAI 2019
Solving Integer Quadratic Programming via Explicit and Structural Restrictions
AAAI 2019
Submodular Function Minimization with Noisy Evaluation Oracle
NeurIPS 2019
Systematic Conservation Planning for Sustainable Land-use Policies: A Constrained Partitioning Approach to Reserve Selection and Design.
IJCAI 2019
The Parameterized Complexity of Cascading Portfolio Scheduling
NeurIPS 2019
Towards Sequence-to-Sequence Reinforcement Learning for Constraint Solving with Constraint-Based Local Search
AAAI 2019
Adaptive Group Testing Algorithms to Estimate the Number of Defectives
ALT 2018
Adversarial Attack on Graph Structured Data
ICML 2018
Adversarial Task Assignment
IJCAI 2018
A Fast Algorithm for Generalized Arc Consistency of the Alldifferent Constraint
IJCAI 2018
A Fast Algorithm for Optimally Finding Partially Disjoint Shortest Paths
IJCAI 2018
A Framework for Constraint Based Local Search using Essence
IJCAI 2018
An FPTAS for Computing Nash Equilibrium in Resource Graph Games
IJCAI 2018
An Optimization Approach to Learning Falling Rule Lists
AISTATS 2018
A Scalable Scheme for Counting Linear Extensions
IJCAI 2018
Bayesian Optimization of Combinatorial Structures
ICML 2018
Boosting Combinatorial Problem Modeling with Machine Learning
IJCAI 2018