Combinatorial Optimization

The FF Heuristic for Lifted Classical Planning AAAI 2022 Theory and Approximate Solvers for Branched Optimal Transport with Multiple Sources NeurIPS 2022 Theory of and Experiments on Minimally Invasive Stability Preservation in Changing Two-Sided Matching Markets AAAI 2022 The Power of Media Agencies in Ad Auctions: Improving Utility through Coordinated Bidding IJCAI 2022 The Query Complexity of Cake Cutting NeurIPS 2022 The SoftCumulative Constraint with Quadratic Penalty AAAI 2022 The Triangle-Densest-K-Subgraph Problem: Hardness, Lovász Extension, and Application to Document Summarization AAAI 2022 Thompson Sampling for (Combinatorial) Pure Exploration ICML 2022 Threshold-free Pattern Mining Meets Multi-Objective Optimization: Application to Association Rules IJCAI 2022 Tiger: Disk-Adaptive Redundancy Without Placement Restrictions OSDI 2022 Time-Constrained Participatory Budgeting Under Uncertain Project Costs IJCAI 2022 Tractable & Coherent Multi-Document Summarization: Discrete Optimization of Multiple Neural Modeling Streams via Integer Linear Programming EMNLP 2022 Traversing Supervisor Problem: An Approximately Optimal Approach to Multi-Robot Assistance RSS 2022 Two Compacted Models for Efficient Model-Based Diagnosis AAAI 2022 Two-Price Equilibrium AAAI 2022 Two-Sided Weak Submodularity for Matroid Constrained Optimization and Regression COLT 2022 Undercover Boolean Matrix Factorization with MaxSAT AAAI 2022 Unsupervised Learning for Combinatorial Optimization with Principled Objective Relaxation NeurIPS 2022 Using Constraint Programming and Graph Representation Learning for Generating Interpretable Cloud Security Policies IJCAI 2022 Using hierarchies to efficiently combine evidence with Dempster’s rule of combination UAI 2022 Using Partial Monotonicity in Submodular Maximization NeurIPS 2022 Verification and search algorithms for causal DAGs NeurIPS 2022 When Combinatorial Thompson Sampling meets Approximation Regret NeurIPS 2022 Word Tour: One-dimensional Word Embeddings via the Traveling Salesman Problem NAACL 2022 A Bi-Level Framework for Learning to Solve Combinatorial Optimization on Graphs NeurIPS 2021