Skip to content
conftrace_

combinatorial optimization

1,103 papers

CO

Papers

Unconstrained MAP Inference, Exponentiated Determinantal Point Processes, and Exponential Inapproximability AISTATS 2021 USCO-Solver: Solving Undetermined Stochastic Combinatorial Optimization Problems NeurIPS 2021 Weighting-based Variable Neighborhood Search for Optimal Camera Placement AAAI 2021 When Hashing Met Matching: Efficient Spatio-Temporal Search for Ridesharing AAAI 2021 Accelerating Primal Solution Findings for Mixed Integer Programs Based on Solution Prediction AAAI 2020 Accelerating Ranking in E-Commerce Search Engines through Contextual Factor Selection AAAI 2020 Adversarial Learning for 3D Matching UAI 2020 A General Large Neighborhood Search Framework for Solving Integer Linear Programs NeurIPS 2020 A Learning Based Branch and Bound for Maximum Common Subgraph Related Problems AAAI 2020 A Learning-based Iterative Method for Solving Vehicle Routing Problems ICLR 2020 A MaxSAT-Based Framework for Group Testing AAAI 2020 An Empirical Process Approach to the Union Bound: Practical Algorithms for Combinatorial and Linear Bandits NeurIPS 2020 An Interactive Regret-Based Genetic Algorithm for Solving Multi-Objective Combinatorial Optimization Problems AAAI 2020 Approximate Pareto Set for Fair and Efficient Allocation: Few Agent Types or Few Resource Types IJCAI 2020 A Primal-Dual Solver for Large-Scale Tracking-by-Assignment AISTATS 2020 A Quantum Computational Approach to Correspondence Problems on Point Sets CVPR 2020 A Spectral Method for Unsupervised Multi-Document Summarization EMNLP 2020 A State Aggregation Approach for Solving Knapsack Problem with Deep Reinforcement Learning ACML 2020 Bayesian experimental design using regularized determinantal point processes AISTATS 2020 Belief Propagation Neural Networks NeurIPS 2020 Bisect and Conquer: Hierarchical Clustering via Max-Uncut Bisection AISTATS 2020 “Bring Your Own Greedy”+Max: Near-Optimal 1/2-Approximations for Submodular Knapsack AISTATS 2020 Budgeted Online Influence Maximization ICML 2020 Building Scalable and Flexible Cluster Managers Using Declarative Programming OSDI 2020 Cakewalk Sampling AAAI 2020