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
A Fast Maximum k-Plex Algorithm Parameterized by the Degeneracy Gap
IJCAI 2023
Optimal Seat Arrangement: What Are the Hard and Easy Cases?
IJCAI 2023
Neural Combinatorial Optimization with Heavy Decoder: Toward Large Scale Generalization
NIPS 2023
Optimization of Inter-group criteria for clustering with minimum size constraints
NIPS 2023
Causal Effect Identification in Uncertain Causal Networks
NIPS 2023
Legal Argument Extraction from Court Judgements using Integer Linear Programming
EMNLP 2023
Geometric Barriers for Stable and Online Algorithms for Discrepancy Minimization
COLT 2023
DIFUSCO: Graph-based Diffusion Solvers for Combinatorial Optimization
NIPS 2023
Parallel Index-Based Search Algorithm for Coalition Structure Generation (Student Abstract)
AAAI 2023
Minimum-Entropy Coupling Approximation Guarantees Beyond the Majorization Barrier
AISTATS 2023
Submodular Order Functions and Assortment Optimization
ICML 2023
Efficient Map Sparsification Based on 2D and 3D Discretized Grids
CVPR 2023
Free Lunch for Efficient Textual Commonsense Integration in Language Models
ACL 2023
The Power of Uniform Sampling for k-Median
ICML 2023
Dynamic Constrained Submodular Optimization with Polylogarithmic Update Time
ICML 2023
ClusterFuG: Clustering Fully connected Graphs by Multicut
ICML 2023
Nonstochastic Contextual Combinatorial Bandits
AISTATS 2023
Decipherment of Lost Ancient Scripts as Combinatorial Optimisation Using Coupled Simulated Annealing
ACL 2023
Memory-Constrained Algorithms for Convex Optimization
NIPS 2023
Two-Stage Predict+Optimize for MILPs with Unknown Parameters in Constraints
NIPS 2023
A Deep Instance Generative Framework for MILP Solvers Under Limited Data Availability
NIPS 2023
Size-constrained k-submodular maximization in near-linear time
UAI 2023
Greed is good: correspondence recovery for unlabeled linear regression
UAI 2023
Further Adaptive Best-of-Both-Worlds Algorithm for Combinatorial Semi-Bandits
AISTATS 2023
Maximizing submodular functions under submodular constraints
UAI 2023
<
1
…
20
21
22
…
97
>