Discrete Optimization

Compact MDDs for Pseudo-Boolean Constraints with At-Most-One Relations in Resource-Constrained Scheduling Problems IJCAI 2017 Computing an Approximately Optimal Agreeable Set of Items IJCAI 2017 Constraint-Based Symmetry Detection in General Game Playing IJCAI 2017 Decomposable Submodular Function Minimization: Discrete and Continuous NeurIPS 2017 Differentiable Learning of Submodular Models NeurIPS 2017 Differentially Private Submodular Maximization: Data Summarization in Disguise ICML 2017 Efficient Discontinuous Phrase-Structure Parsing via the Generalized Maximum Spanning Arborescence EMNLP 2017 Efficient Optimal Search under Expensive Edge Cost Computation IJCAI 2017 Efficient Optimization for Hierarchically-structured Interacting Segments (HINTS) CVPR 2017 Efficient Weighted Model Integration via SMT-Based Predicate Abstraction IJCAI 2017 Experimental Design for Learning Causal Graphs with Latent Variables NeurIPS 2017 Faster Conflict Generation for Dynamic Controllability IJCAI 2017 Faster Greedy MAP Inference for Determinantal Point Processes ICML 2017 Front-to-End Bidirectional Heuristic Search with Near-Optimal Node Expansions IJCAI 2017 Fundamental Conditions for Low-CP-Rank Tensor Completion JMLR 2017 Integer Linear Programming formulations in Natural Language Processing EACL 2017 k-Support and Ordered Weighted Sparsity for Overlapping Groups: Hardness and Algorithms NeurIPS 2017 Linear regression without correspondence NeurIPS 2017 Minimizing a Submodular Function from Samples NeurIPS 2017 Nonlinear Hybrid Planning with Deep Net Learned Transition Models and Mixed-Integer Linear Programming IJCAI 2017 On Creating Complementary Pattern Databases IJCAI 2017 Online Bridged Pruning for Real-Time Search with Arbitrary Lookaheads IJCAI 2017 On Neighborhood Singleton Consistencies IJCAI 2017 On the Kernelization of Global Constraints IJCAI 2017 Parametric Simplex Method for Sparse Learning NeurIPS 2017