Research Explorer
Papers
Trends
Conferences
Explore
Authors
Topics
Keywords
Papers
Trends
Conferences
Explore
Authors
Topics
Keywords
Achievements
About
Methodology
← Optimization
Mathematics & Optimization
›
Optimization
›
Combinatorial Optimization
2407 directly classified papers
Papers per year
2002: 1
2004: 1
2005: 2
2006: 9
2007: 6
2008: 5
2009: 16
2010: 20
2011: 19
2012: 19
2013: 53
2014: 48
2015: 67
2016: 61
2017: 137
2018: 174
2019: 220
2020: 270
2021: 264
2022: 259
2023: 295
2024: 230
2025: 149
2026: 82
Papers
Combinatorial Pure Exploration with Continuous and Separable Reward Functions and Its Applications
IJCAI 2018
OATM: Occlusion Aware Template Matching by Consensus Set Maximization
CVPR 2018
Graph-Cut RANSAC
CVPR 2018
Creating Capsule Wardrobes From Fashion Images
CVPR 2018
Diverse Ensemble Evolution: Curriculum Data-Model Marriage
NIPS 2018
Non-monotone Submodular Maximization in Exponentially Fewer Iterations
NIPS 2018
A Fast Local Search Algorithm for Minimum Weight Dominating Set Problem on Massive Graphs
IJCAI 2018
Improving Information Centrality of a Node in Complex Networks by Adding Edges
IJCAI 2018
Scheduling under Uncertainty: A Query-based Approach
IJCAI 2018
Unary Integer Linear Programming with Structural Restrictions
IJCAI 2018
Reduced Cost Fixing for Maximum Satisfiability
IJCAI 2018
Joint Cuts and Matching of Partitions in One Graph
CVPR 2018
Topkapi: Parallel and Fast Sketches for Finding Top-K Frequent Elements
NIPS 2018
Limited Memory Kelley's Method Converges for Composite Convex and Submodular Objectives
NIPS 2018
Fast greedy algorithms for dictionary selection with generalized sparsity constraints
NIPS 2018
Fast Greedy MAP Inference for Determinantal Point Process to Improve Recommendation Diversity
NIPS 2018
Sketching Method for Large Scale Combinatorial Inference
NIPS 2018
Revisiting Decomposable Submodular Function Minimization with Incidence Relations
NIPS 2018
Experimental Design for Cost-Aware Learning of Causal Graphs
NIPS 2018
On Misinformation Containment in Online Social Networks
NIPS 2018
Support Recovery for Orthogonal Matching Pursuit: Upper and Lower bounds
NIPS 2018
Boolean Decision Rules via Column Generation
NIPS 2018
Efficient Algorithms for Non-convex Isotonic Regression through Submodular Optimization
NIPS 2018
Solving Exist-Random Quantified Stochastic Boolean Satisfiability via Clause Selection
IJCAI 2018
Multi-objective Maximization of Monotone Submodular Functions with Cardinality Constraint
NIPS 2018
<
1
…
71
72
73
…
97
>