SOTAVerified

Combinatorial Optimization

Combinatorial Optimization is a category of problems which requires optimizing a function over a combination of discrete objects and the solutions are constrained. Examples include finding shortest paths in a graph, maximizing value in the Knapsack problem and finding boolean settings that satisfy a set of constraints. Many of these problems are NP-Hard, which means that no polynomial time solution can be developed for them. Instead, we can only produce approximations in polynomial time that are guaranteed to be some factor worse than the true optimal solution.

Source: Recent Advances in Neural Program Synthesis

Papers

Showing 551600 of 1277 papers

TitleStatusHype
Mathematical Models and Reinforcement Learning based Evolutionary Algorithm Framework for Satellite Scheduling Problem0
Importance weighting without importance weights: An efficient algorithm for combinatorial semi-bandits0
A Simulated Annealing-Based Multiobjective Optimization Algorithm for Minimum Weight Minimum Connected Dominating Set Problem0
Actively Learning Combinatorial Optimization Using a Membership Oracle0
A2Perf: Real-World Autonomous Agents Benchmark0
Image Super-Resolution Based on Sparsity Prior via Smoothed l_0 Norm0
Unsupervised Training of Diffusion Models for Feasible Solution Generation in Neural Combinatorial Optimization0
Cost-aware Feature Selection for IoT Device Classification0
Knowledge engineering mixed-integer linear programming: constraint typology0
Large Scale Constrained Clustering With Reinforcement Learning0
Leader Reward for POMO-Based Neural Combinatorial Optimization0
Cortical Processing with Thermodynamic-RAM0
COPS: Controlled Pruning Before Training Starts0
A Review of the Family of Artificial Fish Swarm Algorithms: Recent Advances and Applications0
Cooperative coevolutionary hybrid NSGA-II with Linkage Measurement Minimization for Large-scale Multi-objective optimization0
Cool-Fusion: Fuse Large Language Models without Training0
How to calculate partition functions using convex programming hierarchies: provable bounds for variational methods0
How Multimodal Integration Boost the Performance of LLM for Optimization: Case Study on Capacitated Vehicle Routing Problems0
A Knowledge Representation Approach to Automated Mathematical Modelling0
Joint Ranging and Phase Offset Estimation for Multiple Drones using ADS-B Signatures0
How Good Is Neural Combinatorial Optimization? A Systematic Evaluation on the Traveling Salesman Problem0
High-quality Thermal Gibbs Sampling with Quantum Annealing Hardware0
HyColor: An Efficient Heuristic Algorithm for Graph Coloring0
IA-GM: A Deep Bidirectional Learning Method for Graph Matching0
Convergence and Running Time of Time-dependent Ant Colony Algorithms0
Highly parallel algorithm for the Ising ground state searching problem0
Artificial Catalytic Reactions in 2D for Combinatorial Optimization0
A Large Language Model-Enhanced Q-learning for Capacitated Vehicle Routing Problem with Time Windows0
Implicitly Intersecting Weighted Automata using Dual Decomposition0
High-Level Plan for Behavioral Robot Navigation with Natural Language Directions and R-NET0
A Knowledge-Based Approach to Word Sense Disambiguation by distributional selection and semantic features0
Improved Approximation Algorithms for Low-Rank Problems Using Semidefinite Optimization0
Higher-Order Quantum-Inspired Genetic Algorithms0
Improvement/Extension of Modular Systems as Combinatorial Reengineering (Survey)0
Improving Existing Optimization Algorithms with LLMs0
Cross-Problem Parameter Transfer in Quantum Approximate Optimization Algorithm: A Machine Learning Approach0
Higher-Order Neuromorphic Ising Machines -- Autoencoders and Fowler-Nordheim Annealers are all you need for Scalability0
High-Dimensional Prediction for Sequential Decision Making0
Inference in Graphical Models via Semidefinite Programming Hierarchies0
Inference of hidden structures in complex physical systems by multi-scale clustering0
Information-theoretic Feature Selection via Tensor Decomposition and Submodularity0
INGEOTEC at SemEval 2017 Task 4: A B4MSA Ensemble based on Genetic Programming for Twitter Sentiment Analysis0
INGEOTEC at SemEval-2018 Task 1: EvoMSA and μTC for Sentiment Analysis0
Initialization Method for Factorization Machine Based on Low-Rank Approximation for Constructing a Corrected Approximate Ising Model0
Hierarchical Clustering: Objective Functions and Algorithms0
Assessment of Reinforcement Learning Algorithms for Nuclear Power Plant Fuel Optimization0
Convergence Acceleration of Markov Chain Monte Carlo-based Gradient Descent by Deep Unfolding0
Joint Graph Decomposition & Node Labeling: Problem, Algorithms, Applications0
DAN: Decentralized Attention-based Neural Network for the MinMax Multiple Traveling Salesman Problem0
Joint User Pairing and Association for Multicell NOMA: A Pointer Network-based Approach0
Show:102550
← PrevPage 12 of 26Next →

No leaderboard results yet.