Skip to content
conftrace_

Combinatorial Optimization

2,615 papers

2
22
68
274
244
'5
'10
'15
'20
'25

Papers

Learning Set Functions that are Sparse in Non-Orthogonal Fourier Bases AAAI 2021 Learning Sparse Classifiers: Continuous and Mixed Integer Optimization Perspectives JMLR 2021 Learning Strategies in Decentralized Matching Markets under Uncertain Preferences JMLR 2021 Learning to delegate for large-scale vehicle routing NeurIPS 2021 Learning to Schedule Heuristics in Branch and Bound NeurIPS 2021 Learning to Select Exogenous Events for Marked Temporal Point Process NeurIPS 2021 Learning Within an Instance for Designing High-Revenue Combinatorial Auctions IJCAI 2021 Local Correlation Clustering with Asymmetric Classification Errors ICML 2021 Local Search for Diversified Top-k s-plex Search Problem (Student Abstract) AAAI 2021 Long-term, Short-term and Sudden Event: Trading Volume Movement Prediction with Graph-based Multi-view Modeling IJCAI 2021 Making Higher Order MOT Scalable: An Efficient Approximate Solver for Lifted Disjoint Paths ICCV 2021 Matchings with Group Fairness Constraints: Online and Offline Algorithms IJCAI 2021 Matrix encoding networks for neural combinatorial optimization NeurIPS 2021 Maximin Fairness with Mixed Divisible and Indivisible Goods AAAI 2021 Maximization of Monotone k-Submodular Functions with Bounded Curvature and Non-k-Submodular Functions ACML 2021 Maximizing Agreements for Ranking, Clustering and Hierarchical Clustering via MAX-CUT AISTATS 2021 Memory-Efficient Approximation Algorithms for Max-k-Cut and Correlation Clustering NeurIPS 2021 Mercer Features for Efficient Combinatorial Bayesian Optimization AAAI 2021 Mind the Gap: Cake Cutting With Separation AAAI 2021 Minimizing Energy Use of Mixed-Fleet Public Transit for Fixed-Route Service AAAI 2021 Minimizing Polarization and Disagreement in Social Networks via Link Recommendation NeurIPS 2021 Minimum Robust Multi-Submodular Cover for Fairness AAAI 2021 Multi-Goal Multi-Agent Path Finding via Decoupled and Integrated Goal Vertex Ordering AAAI 2021 Multi-layered Network Exploration via Random Walks: From Offline Optimization to Online Learning ICML 2021 Multi-Objective Submodular Maximization by Regret Ratio Minimization with Theoretical Guarantee AAAI 2021