combinatorial optimization

Learning NP-Hard Multi-Agent Assignment Planning using GNN: Inference on a Random Graph and Provable Auction-Fitted Q-learning NeurIPS 2022 Learning Scenario Representation for Solving Two-stage Stochastic Integer Programs ICLR 2022 Learning to Compare Nodes in Branch and Bound with Graph Neural Networks NeurIPS 2022 Learning to Solve Travelling Salesman Problem with Hardness-Adaptive Curriculum AAAI 2022 LeNSE: Learning To Navigate Subgraph Embeddings for Large-Scale Combinatorial Optimisation ICML 2022 Matching Market Design with Constraints AAAI 2022 Maximizing Nash Social Welfare in 2-Value Instances AAAI 2022 Maximizing Revenue under Market Shrinkage and Market Uncertainty NeurIPS 2022 Maximum Consensus by Weighted Influences of Monotone Boolean Functions CVPR 2022 Minimum Cost Intervention Design for Causal Effect Identification ICML 2022 MIP-GNN: A Data-Driven Framework for Guiding Combinatorial Solvers AAAI 2022 MurTree: Optimal Decision Trees via Dynamic Programming and Search JMLR 2022 Navigating Memory Construction by Global Pseudo-Task Simulation for Continual Learning NeurIPS 2022 Neural Estimation of Submodular Functions with Applications to Differentiable Subset Selection NeurIPS 2022 Neural Set Function Extensions: Learning with Discrete Functions in High Dimensions NeurIPS 2022 Neural Topological Ordering for Computation Graphs NeurIPS 2022 NukCP: An Improved Local Search Algorithm for Maximum k-Club Problem AAAI 2022 One-Pass Algorithms for MAP Inference of Nonsymmetric Determinantal Point Processes ICML 2022 Online Learning for Min Sum Set Cover and Pandora’s Box ICML 2022 Optimistic Tree Searches for Combinatorial Black-Box Optimization NeurIPS 2022 Optimizing Tensor Network Contraction Using Reinforcement Learning ICML 2022 Placing Green Bridges Optimally, with Habitats Inducing Cycles IJCAI 2022 Planning with Explanations for Finding Desired Meeting Points on Graphs AAAI 2022 Pretrained Cost Model for Distributed Constraint Optimization Problems AAAI 2022 Quant-BnB: A Scalable Branch-and-Bound Method for Optimal Decision Trees with Continuous Features ICML 2022