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

Recently AddedMost HypedMost ActiveNeeds VerificationMost Verified

Showing 901–950 of 1277 papers

TitleStatusHype
A Comparison of Greedy and Optimal Assessment of Natural Language Student Input Using Word-to-Word Similarity Metrics—0
A Compositional Algorithm for the Conflict-Free Electric Vehicle Routing Problem—0
A conditional gradient homotopy method with applications to Semidefinite Programming—0
Active Instance Sampling via Matrix Partition—0
Actively Learning Combinatorial Optimization Using a Membership Oracle—0
Active Screening for Recurrent Diseases: A Reinforcement Learning Approach—0
Adam assisted Fully informed Particle Swarm Optimzation ( Adam-FIPSO ) based Parameter Prediction for the Quantum Approximate Optimization Algorithm (QAOA)—0
Adaptive Bias Generalized Rollout Policy Adaptation on the Flexible Job-Shop Scheduling Problem—0
Adaptive Non-Uniform Timestep Sampling for Accelerating Diffusion Model Training—0
A Data-Driven Column Generation Algorithm For Bin Packing Problem in Manufacturing Industry—0
Addressing The Knapsack Challenge Through Cultural Algorithm Optimization—0
A Differentiable Approach to Combinatorial Optimization using Dataless Neural Networks—0
A Discrete State Transition Algorithm for Generalized Traveling Salesman Problem—0
A Distribution Evolutionary Algorithm for the Graph Coloring Problem—0
A Dynamic Algorithm for the Longest Common Subsequence Problem using Ant Colony Optimization Technique—0
A Dynamic Programming Algorithm for Tree Trimming-based Text Summarization—0
AED: An Anytime Evolutionary DCOP Algorithm—0
A Fitness Landscape View on the Tuning of an Asynchronous Master-Worker EA for Nuclear Reactor Design—0
A full-stack view of probabilistic computing with p-bits: devices, architectures and algorithms—0
A General Large Neighborhood Search Framework for Solving Integer Linear Programs—0
A Generative Graph Method to Solve the Travelling Salesman Problem—0
A Generative Neural Annealer for Black-Box Combinatorial Optimization—0
A Generic Bet-and-run Strategy for Speeding Up Traveling Salesperson and Minimum Vertex Cover—0
A Genetic Algorithm for solving Quadratic Assignment Problem(QAP)—0
Distributed Task Offloading and Resource Allocation for Latency Minimization in Mobile Edge Computing Networks—0
A Graph Multi-separator Problem for Image Segmentation—0
A Graph Neural Network-Based QUBO-Formulated Hamiltonian-Inspired Loss Function for Combinatorial Optimization using Reinforcement Learning—0
A Heuristic Based on Randomized Greedy Algorithms for the Clustered Shortest-Path Tree Problem—0
A Hybrid Evolutionary Algorithm Based on Solution Merging for the Longest Arc-Preserving Common Subsequence Problem—0
A Knowledge-Based Approach to Word Sense Disambiguation by distributional selection and semantic features—0
A Knowledge Representation Approach to Automated Mathematical Modelling—0
A Large Language Model-Enhanced Q-learning for Capacitated Vehicle Routing Problem with Time Windows—0
Algorithm Discovery With LLMs: Evolutionary Search Meets Reinforcement Learning—0
Algorithms Inspired by Nature: A Survey—0
Algoritmos Genéticos Aplicado ao Problema de Roteamento de Veículos—0
A Local Optima Network View of Real Function Fitness Landscapes—0
A machine learning framework for neighbor generation in metaheuristic search—0
A Memetic Algorithm Based on Breakout Local Search for the Generalized Travelling Salesman Problem—0
A Meta-heuristically Approach of the Spatial Assignment Problem of Human Resources in Multi-sites Enterprise—0
Amplitude-Ensemble Quantum-Inspired Tabu Search Algorithm for Solving 0/1 Knapsack Problems—0
A Multi-task Selected Learning Approach for Solving 3D Flexible Bin Packing Problem—0
Analysis of Quality Diversity Algorithms for the Knapsack Problem—0
Analyzing the behaviour of D'WAVE quantum annealer: fine-tuning parameterization and tests with restrictive Hamiltonian formulations—0
An Approximation Algorithm for Risk-averse Submodular Optimization—0
An Attention-LSTM Hybrid Model for the Coordinated Routing of Multiple Vehicles—0
An Edge-Aware Graph Autoencoder Trained on Scale-Imbalanced Data for Traveling Salesman Problems—0
An Efficient Algorithm for Cooperative Semi-Bandits—0
An efficient algorithm for learning with semi-bandit feedback—0
An Efficient Circuit Compilation Flow for Quantum Approximate Optimization Algorithm—0
An Efficient Learning-based Solver Comparable to Metaheuristics for the Capacitated Arc Routing Problem—0
Show:102550
← PrevPage 19 of 26Next →

No leaderboard results yet.