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
With Measured Words: Simple Sentence Selection for Black-Box Optimization of Sentence Compression Algorithms
EACL 2021
Extreme k-Center Clustering
AAAI 2021
Dynamic Rebalancing Dockless Bike-Sharing System based on Station Community Discovery
IJCAI 2021
On the Parameterized Complexity of Polytree Learning
IJCAI 2021
Improved Acyclicity Reasoning for Bayesian Network Structure Learning with Constraint Programming
IJCAI 2021
Automatic Design of Heuristic Algorithms for Binary Optimization Problems
IJCAI 2021
Adaptive Experimental Design for Optimizing Combinatorial Structures
IJCAI 2021
Abstract Cores in Implicit Hitting Set MaxSat Solving (Extended Abstract)
IJCAI 2021
On Continuous Local BDD-Based Search for Hybrid SAT Solving
AAAI 2021
On Fair Division under Heterogeneous Matroid Constraints
AAAI 2021
Graph Matching with Partially-Correct Seeds
JMLR 2021
PoA of Simple Auctions with Interdependent Values
AAAI 2021
Mind the Gap: Cake Cutting With Separation
AAAI 2021
Connect Multi-Agent Path Finding: Generation and Visualization
IJCAI 2021
When Hashing Met Matching: Efficient Spatio-Temporal Search for Ridesharing
AAAI 2021
Representative Proxy Voting
AAAI 2021
Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity
ICML 2021
Instance Specific Approximations for Submodular Maximization
ICML 2021
Heuristic Search for Approximating One Matrix in Terms of Another Matrix
IJCAI 2021
Improved CP-Based Lagrangian Relaxation Approach with an Application to the TSP
IJCAI 2021
One-sided Frank-Wolfe algorithms for saddle problems
ICML 2021
Graph Cuts Always Find a Global Optimum for Potts Models (With a Catch)
ICML 2021
Learning Branching Heuristics for Propositional Model Counting
AAAI 2021
Making Higher Order MOT Scalable: An Efficient Approximate Solver for Lifted Disjoint Paths
ICCV 2021
Fairness in Influence Maximization through Randomization
AAAI 2021
<
1
…
48
49
50
…
97
>