Skip to content
conftrace_

Discrete Optimization

721 papers

10
26
66
59
'10
'15
'20
'25

Papers

Learning Interpretable Decision Rule Sets: A Submodular Optimization Approach NeurIPS 2021 Learning Sparse Classifiers: Continuous and Mixed Integer Optimization Perspectives JMLR 2021 Making Higher Order MOT Scalable: An Efficient Approximate Solver for Lifted Disjoint Paths ICCV 2021 Maximin Fairness with Mixed Divisible and Indivisible Goods AAAI 2021 Minimizing Energy Use of Mixed-Fleet Public Transit for Fixed-Route Service AAAI 2021 Multidimensional Scaling: Approximation and Complexity ICML 2021 Multi-Objective Submodular Maximization by Regret Ratio Minimization with Theoretical Guarantee AAAI 2021 Necessary and Sufficient Conditions for Avoiding Reopenings in Best First Suboptimal Search with General Bounding Functions AAAI 2021 Network Inference and Influence Maximization from Samples ICML 2021 Non-approximate Inference for Collective Graphical Models on Path Graphs via Discrete Difference of Convex Algorithm NeurIPS 2021 Optimal Algorithms for Submodular Maximization with Distributed Constraints L4DC 2021 Ordered Counterfactual Explanation by Mixed-Integer Linear Optimization AAAI 2021 Parameterized Algorithms for MILPs with Small Treedepth AAAI 2021 Passive learning of Timed Automata from logs (Student Abstract) AAAI 2021 Personalized Extractive Summarization Using an Ising Machine Towards Real-time Generation of Efficient and Coherent Dialogue Scenarios EMNLP 2021 Practical Null Steering in Millimeter Wave Networks NSDI 2021 Problem Dependent View on Structured Thresholding Bandit Problems ICML 2021 Projection-free Decentralized Online Learning for Submodular Maximization over Time-Varying Networks JMLR 2021 Randomized Algorithms for Submodular Function Maximization with a k-System Constraint ICML 2021 Randomized Dimensionality Reduction for Facility Location and Single-Linkage Clustering ICML 2021 Reasoning-Based Learning of Interpretable ML Models IJCAI 2021 Regularized Submodular Maximization at Scale ICML 2021 Restricted Domains of Dichotomous Preferences with Possibly Incomplete Information AAAI 2021 Reusing Combinatorial Structure: Faster Iterative Projections over Submodular Base Polytopes NeurIPS 2021 Sampling Partial Acyclic Orientations in Chordal Graphs by the Lovasz Local Lemma (Student Abstract) AAAI 2021