Combinatorial Optimization

Learning Cut Selection for Mixed-Integer Linear Programming via Hierarchical Sequence Model ICLR 2023 Learning Cuts via Enumeration Oracles NeurIPS 2023 Learning Large-Scale MTP$_2$ Gaussian Graphical Models via Bridge-Block Decomposition NeurIPS 2023 Learning to Break Symmetries for Efficient Optimization in Answer Set Programming AAAI 2023 Learning to Configure Separators in Branch-and-Cut NeurIPS 2023 Learning To Dive In Branch And Bound NeurIPS 2023 Learning to Generate Columns with Application to Vertex Coloring ICLR 2023 Learning When to Use Automatic Tabulation in Constraint Model Reformulation IJCAI 2023 Legal Argument Extraction from Court Judgements using Integer Linear Programming EMNLP 2023 Let the Flows Tell: Solving Graph Combinatorial Problems with GFlowNets NeurIPS 2023 Lifted Inference with Linear Order Axiom AAAI 2023 Lifting (D)QBF Preprocessing and Solving Techniques to (D)SSAT AAAI 2023 Limits of Dense Simplicial Complexes JMLR 2023 Linear Query Approximation Algorithms for Non-monotone Submodular Maximization under Knapsack Constraint IJCAI 2023 Linear Time Algorithms for k-means with Multi-Swap Local Search NeurIPS 2023 Lo-Hi: Practical ML Drug Discovery Benchmark NeurIPS 2023 Matchings under One-Sided Preferences with Soft Quotas IJCAI 2023 Maximin-Aware Allocations of Indivisible Chores with Symmetric and Asymmetric Agents IJCAI 2023 Maximization of Minimum Weighted Hamming Distance between Set Pairs ACML 2023 Maximizing Influence Spread through a Dynamic Social Network (Student Abstract) AAAI 2023 Maximizing submodular functions under submodular constraints UAI 2023 Maximizing the Probability of Fixation in the Positional Voter Model AAAI 2023 Maximum Independent Set: Self-Training through Dynamic Programming NeurIPS 2023 Memory-Constrained Algorithms for Convex Optimization NeurIPS 2023 Meta-SAGE: Scale Meta-Learning Scheduled Adaptation with Guided Exploration for Mitigating Scale Shift on Combinatorial Optimization ICML 2023