conftrace_
← Optimization
Mathematics & Optimization › Optimization ›

Combinatorial Optimization

2,409 papers

Papers per year

2
20
67
270
149
'05
'10
'15
'20
'25

Papers

A Novel Approach for Constrained Optimization in Graphical Models NIPS 2020
Fully Dynamic Algorithm for Constrained Submodular Optimization NIPS 2020
Fairness in Streaming Submodular Maximization: Algorithms and Hardness NIPS 2020
Robust Multi-Object Matching via Iterative Reweighting of the Graph Connection Laplacian NIPS 2020
Robust Sequence Submodular Maximization NIPS 2020
StratLearner: Learning a Strategy for Misinformation Prevention in Social Networks NIPS 2020
Decisions, Counterfactual Explanations and Strategic Behavior NIPS 2020
Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint NIPS 2020
Hybrid Models for Learning to Branch NIPS 2020
Content Provider Dynamics and Coordination in Recommendation Ecosystems NIPS 2020
Linear-Sample Learning of Low-Rank Distributions NIPS 2020
The Adaptive Complexity of Maximizing a Gross Substitutes Valuation NIPS 2020
Graduated Assignment for Joint Multi-Graph Matching and Clustering with Application to Unsupervised Graph Matching Network Learning NIPS 2020
GCOMB: Learning Budget-constrained Combinatorial Algorithms over Billion-sized Graphs NIPS 2020
A General Large Neighborhood Search Framework for Solving Integer Linear Programs NIPS 2020
Gradient Method for Continuous Influence Maximization with Budget-Saving Considerations AAAI 2020
Understanding and Improving Proximity Graph Based Maximum Inner Product Search AAAI 2020
Neural Approximate Dynamic Programming for On-Demand Ride-Pooling AAAI 2020
Protecting Geolocation Privacy of Photo Collections AAAI 2020
Real-Time Route Search by Locations AAAI 2020
Pay Your Trip for Traffic Congestion: Dynamic Pricing in Traffic-Aware Road Networks AAAI 2020
Adaptive Greedy versus Non-Adaptive Greedy for Influence Maximization AAAI 2020
Finding Minimum-Weight Link-Disjoint Paths with a Few Common Nodes AAAI 2020
Improved Filtering for the Euclidean Traveling Salesperson Problem in CLP(FD) AAAI 2020
Chain Length and CSPs Learnable with Few Queries AAAI 2020