conftrace_
← Optimization
Mathematics & Optimization › Optimization ›

Combinatorial Optimization

2,409 papers

Papers per year

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

Papers

Exploring Tradeoffs in Automated School Redistricting: Computational and Ethical Perspectives AAAI 2023
Maximizing Influence Spread through a Dynamic Social Network (Student Abstract) AAAI 2023
Parallel Index-Based Search Algorithm for Coalition Structure Generation (Student Abstract) AAAI 2023
Adaptive Constraint Partition Based Optimization Framework for Large-Scale Integer Linear Programming (Student Abstract) AAAI 2023
Dagster: Parallel Structured Search AAAI 2023
Sudoku Assistant – an AI-Powered App to Help Solve Pen-and-Paper Sudokus AAAI 2023
Kajibuntan: A House Chore Division App AAAI 2023
Free Lunch for Efficient Textual Commonsense Integration in Language Models ACL 2023
A Formal Perspective on Byte-Pair Encoding ACL 2023
Decipherment of Lost Ancient Scripts as Combinatorial Optimisation Using Coupled Simulated Annealing ACL 2023
Deep Reinforcement Learning for Two-sided Online Bipartite Matching in Collaborative Order Picking ACML 2023
Self Weighted Multiplex Modularity Maximization for Multiview Clustering ACML 2023
Maximization of Minimum Weighted Hamming Distance between Set Pairs ACML 2023
Scalable Bicriteria Algorithms for Non-Monotone Submodular Cover AISTATS 2023
Select and Optimize: Learning to solve large-scale TSP instances AISTATS 2023
A Constant-Factor Approximation Algorithm for Reconciliation $k$-Median AISTATS 2023
Approximating a RUM from Distributions on $k$-Slates AISTATS 2023
Bayesian Optimization over High-Dimensional Combinatorial Spaces via Dictionary-based Embeddings AISTATS 2023
Randomized Greedy Learning for Non-monotone Stochastic Submodular Maximization Under Full-bandit Feedback AISTATS 2023
Fast Feature Selection with Fairness Constraints AISTATS 2023
Further Adaptive Best-of-Both-Worlds Algorithm for Combinatorial Semi-Bandits AISTATS 2023
Nonstochastic Contextual Combinatorial Bandits AISTATS 2023
Minimum-Entropy Coupling Approximation Guarantees Beyond the Majorization Barrier AISTATS 2023
Reconstructing Ultrametric Trees from Noisy Experiments ALT 2023
A Query Algorithm for Learning a Spanning Forest in Weighted Undirected Graphs ALT 2023