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 1201–1250 of 1277 papers

TitleStatusHype
Chemical Reaction Optimization for the Set Covering Problem—0
Fragmentation trees reloaded—0
Max-Product Belief Propagation for Linear Programming: Applications to Combinatorial Optimization—0
Computational Protein Design Using AND/OR Branch-and-Bound Search—0
On the String Kernel Pre-Image Problem with Applications in Drug Discovery—0
Topic-based Multi-document Summarization using Differential Evolution forCombinatorial Optimization of Sentences—0
Learning to Search in Branch and Bound Algorithms—0
Online combinatorial optimization with stochastic decision sets and adversarial losses—0
Efficient learning by implicit exploration in bandit problems with side observations—0
Chases and Escapes, and Optimization Problems—0
Scalability of using Restricted Boltzmann Machines for Combinatorial Optimization—0
A Weighted Common Subgraph Matching Algorithm—0
Local Optimal Sets and Bounded Archiving on Multi-objective NK-Landscapes with Correlated Objectives—0
Real-time Crowd Tracking using Parameter Optimized Mixture of Motion Models—0
Towards Decision Support Technology Platform for Modular Systems—0
Cortical Processing with Thermodynamic-RAM—0
Learning to Generate Coherent Summary with Discriminative Hidden Semi-Markov Model—0
Quadratically constrained quadratic programming for classification using particle swarms and applications—0
A Comparative Study of Meta-heuristic Algorithms for Solving Quadratic Assignment Problem—0
Higher-Order Quantum-Inspired Genetic Algorithms—0
An interacting replica approach applied to the traveling salesman problem—0
Single Document Summarization based on Nested Tree Structure—0
Mathematical Programming Strategies for Solving the Minimum Common String Partition Problem—0
A Genetic Algorithm for solving Quadratic Assignment Problem(QAP)—0
D-Bees: A Novel Method Inspired by Bee Colony Optimization for Solving Word Sense Disambiguation—0
Matroid Bandits: Fast Combinatorial Optimization with Learning—0
NuMVC: An Efficient Local Search Algorithm for Minimum Vertex Cover—0
Principled Graph Matching Algorithms for Integrating Multiple Data Sources—0
Effective Features of Remote Sensing Image Classification Using Interactive Adaptive Thresholding Method—0
Parallel Genetic Algorithm to Solve Traveling Salesman Problem on MapReduce Framework using Hadoop Cluster—0
A Tutorial on Dual Decomposition and Lagrangian Relaxation for Inference in Natural Language Processing—0
Solving the Minimum Common String Partition Problem with the Help of Ants—0
Budgeted Influence Maximization for Multiple Products—0
Embed and Project: Discrete Sampling with Universal Hashing—0
Statistical estimation for optimization problems on graphs—0
Rough matroids based on coverings—0
Green Heron Swarm Optimization Algorithm - State-of-the-Art of a New Nature Inspired Discrete Meta-Heuristics—0
Potts model, parametric maxflow and k-submodular functions—0
Iterated Variable Neighborhood Search for the resource constrained multi-mode multi-project scheduling problem—0
Dynamic Feature Selection for Dependency Parsing—0
Single-Document Summarization as a Tree Knapsack Problem—0
A Meta-heuristically Approach of the Spatial Assignment Problem of Human Resources in Multi-sites Enterprise—0
Scalable Anomaly Detection in Large Homogenous Populations—0
An ant colony optimization algorithm for job shop scheduling problemCode0
GNCGCP - Graduated NonConvexity and Graduated Concavity Procedure—0
Density Maximization in Context-Sense Metric Space for All-words WSD—0
A Dynamic Algorithm for the Longest Common Subsequence Problem using Ant Colony Optimization Technique—0
Fuzzy Integer Linear Programming Mathematical Models for Examination Timetable Problem—0
Submodularity of a Set Label Disagreement Function—0
Second Order Swarm Intelligence—0
Show:102550
← PrevPage 25 of 26Next →

No leaderboard results yet.