combinatorial optimization

Intervention Efficient Algorithms for Approximate Learning of Causal Graphs ALT 2021 Investigating Methods of Balancing Inequality and Efficiency in Ride Pooling AAAI 2021 Learning 3-opt heuristics for traveling salesman problem via deep reinforcement learning ACML 2021 Learning a Latent Search Space for Routing Problems using Variational Autoencoders ICLR 2021 Learning Augmented Methods for Matching: Improving Invasive Species Management and Urban Mobility AAAI 2021 Learning Branching Heuristics for Propositional Model Counting AAAI 2021 Learning Collaborative Policies to Solve NP-hard Routing Problems NeurIPS 2021 Learning Hard Optimization Problems: A Data Generation Perspective NeurIPS 2021 Learning How to Solve “Bubble Ball” L4DC 2021 Learning Set Functions that are Sparse in Non-Orthogonal Fourier Bases AAAI 2021 Learning to delegate for large-scale vehicle routing NeurIPS 2021 Local Correlation Clustering with Asymmetric Classification Errors ICML 2021 Local Search for Diversified Top-k s-plex Search Problem (Student Abstract) AAAI 2021 Making Higher Order MOT Scalable: An Efficient Approximate Solver for Lifted Disjoint Paths ICCV 2021 Matrix encoding networks for neural combinatorial optimization NeurIPS 2021 Maximizing Agreements for Ranking, Clustering and Hierarchical Clustering via MAX-CUT AISTATS 2021 Mercer Features for Efficient Combinatorial Bayesian Optimization AAAI 2021 Minimizing Polarization and Disagreement in Social Networks via Link Recommendation NeurIPS 2021 Minimum Robust Multi-Submodular Cover for Fairness AAAI 2021 Multi-layered Network Exploration via Random Walks: From Offline Optimization to Online Learning ICML 2021 Nearly Linear-Time, Parallelizable Algorithms for Non-Monotone Submodular Maximization AAAI 2021 Neural Learning of One-of-Many Solutions for Combinatorial Problems in Structured Output Spaces ICLR 2021 NeuroLKH: Combining Deep Learning Model with Lin-Kernighan-Helsgaun Heuristic for Solving the Traveling Salesman Problem NeurIPS 2021 NN-Baker: A Neural-network Infused Algorithmic Framework for Optimization Problems on Geometric Intersection Graphs NeurIPS 2021 On Minimizing the Number of Running Buffers for Tabletop Rearrangement RSS 2021