Skip to content
conftrace_

combinatorial optimization

1,103 papers

CO

Papers

Differentially Private Decomposable Submodular Maximization AAAI 2021 Discovering symbolic policies with deep reinforcement learning ICML 2021 Dual-Mandate Patrols: Multi-Armed Bandits for Green Security AAAI 2021 Efficient Message Passing for 0–1 ILPs with Binary Decision Diagrams ICML 2021 Efficient Online Learning for Dynamic k-Clustering ICML 2021 End-to-End Constrained Optimization Learning: A Survey IJCAI 2021 Enhancing Robustness of Neural Networks through Fourier Stabilization ICML 2021 Exact and approximate hierarchical clustering using A* UAI 2021 Fair Scheduling for Time-dependent Resources NeurIPS 2021 Fair Sparse Regression with Clustering: An Invex Relaxation for a Combinatorial Problem NeurIPS 2021 Faster Guarantees of Evolutionary Algorithms for Maximization of Monotone Submodular Functions IJCAI 2021 Generalized parametric path problems UAI 2021 GLSearch: Maximum Common Subgraph Detection via Learning to Search ICML 2021 Graph Edit Distance Learning via Modeling Optimum Matchings with Constraints IJCAI 2021 Group Testing on a Network AAAI 2021 Harmonious Semantic Line Detection via Maximal Weight Clique Selection CVPR 2021 Heterogeneous Multi-player Multi-armed Bandits: Closing the Gap and Generalization NeurIPS 2021 IA-GM: A Deep Bidirectional Learning Method for Graph Matching AAAI 2021 Implicit MLE: Backpropagating Through Discrete Exponential Family Distributions NeurIPS 2021 Improved Acyclicity Reasoning for Bayesian Network Structure Learning with Constraint Programming IJCAI 2021 Improved Algorithms for Allen's Interval Algebra: a Dynamic Programming Approach IJCAI 2021 Improved CP-Based Lagrangian Relaxation Approach with an Application to the TSP IJCAI 2021 Improved Guarantees for Offline Stochastic Matching via new Ordered Contention Resolution Schemes NeurIPS 2021 Individual Fairness in Kidney Exchange Programs AAAI 2021 Integrated Optimization of Bipartite Matching and Its Stochastic Behavior: New Formulation and Approximation Algorithm via Min-cost Flow Optimization AAAI 2021