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 951–975 of 1277 papers

TitleStatusHype
An End-to-End Reinforcement Learning Based Approach for Micro-View Order-Dispatching in Ride-Hailing—0
A Nested Genetic Algorithm for Explaining Classification Data Sets with Decision Rules—0
An Evolutionary Strategy based on Partial Imitation for Solving Optimization Problems—0
A new dog learns old tricks: RL finds classic optimization algorithms—0
A new hybrid genetic algorithm for protein structure prediction on the 2D triangular lattice—0
A new neighborhood structure for job shop scheduling problems—0
An Expandable Machine Learning-Optimization Framework to Sequential Decision-Making—0
An Improved ACS Algorithm for the Solutions of Larger TSP Problems—0
An Improved Reinforcement Learning Algorithm for Learning to Branch—0
An interacting replica approach applied to the traveling salesman problem—0
An Introduction to Quantum Machine Learning for Engineers—0
An Iterative Path-Breaking Approach with Mutation and Restart Strategies for the MAX-SAT Problem—0
Annealed Mean Field Descent Is Highly Effective for Quadratic Unconstrained Binary Optimization—0
Annealed Training for Combinatorial Optimization on Graphs—0
Annealing Machine-assisted Learning of Graph Neural Network for Combinatorial Optimization—0
An Optimal Quadratic Approach to Monolingual Paraphrase Alignment—0
A novel channel pruning method for deep neural network compression—0
A Novel Column Generation Heuristic for Airline Crew Pairing Optimization with Large-scale Complex Flight Networks—0
A Novel Differentiable Loss Function for Unsupervised Graph Neural Networks in Graph Partitioning—0
An Overview and Experimental Study of Learning-based Optimization Algorithms for Vehicle Routing Problem—0
An SMT Based Compositional Algorithm to Solve a Conflict-Free Electric Vehicle Routing Problem—0
Ant Colony Optimization and Hypergraph Covering Problems—0
An Upper Bound for Minimum True Matches in Graph Isomorphism with Simulated Annealing—0
Anytime Behavior of Inexact TSP Solvers and Perspectives for Automated Algorithm Selection—0
A Polynomial Time Approximation Scheme for a Single Machine Scheduling Problem Using a Hybrid Evolutionary Algorithm—0
Show:102550
← PrevPage 39 of 52Next →

No leaderboard results yet.