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 1101–1125 of 1277 papers

TitleStatusHype
Composing photomosaic images using clustering based evolutionary programming—0
Accelerating E-Commerce Search Engine Ranking by Contextual Factor Selection—0
Smoothed analysis for low-rank solutions to semidefinite programs in quadratic penalty form—0
Cakewalk Sampling—0
Memcomputing: Leveraging memory and physics to compute efficiently—0
Machine Learning Methods for Data Association in Multi-Object Tracking—0
Discrepancy-based Evolutionary Diversity Optimization—0
Graph2Seq: Scalable Learning Dynamics for Graphs—0
Reinforcement Learning for Solving the Vehicle Routing ProblemCode0
When can l_p-norm objective functions be minimized via graph cuts?—0
Spatial Field Reconstruction and Sensor Selection in Heterogeneous Sensor Networks with Stochastic Energy Harvesting—0
Long Term Memory Network for Combinatorial Optimization Problems—0
Evaluation of bioinspired algorithms for the solution of the job scheduling problem—0
Maximizing Submodular or Monotone Approximately Submodular Functions by Multi-objective Evolutionary Algorithms—0
Scalable Relaxations of Sparse Packing Constraints: Optimal Biocontrol in Predator-Prey Network—0
Sensor Selection and Random Field Reconstruction for Robust and Cost-effective Heterogeneous Weather Sensor Networks for the Developing World—0
Deep Learning as a Mixed Convex-Combinatorial Optimization ProblemCode0
The Exact Solution to Rank-1 L1-norm TUCKER2 DecompositionCode0
Reparameterizing the Birkhoff Polytope for Variational Permutation Inference—0
EB-GLS: An Improved Guided Local Search Based on the Big Valley Structure—0
Inference in Graphical Models via Semidefinite Programming Hierarchies—0
Solving a New 3D Bin Packing Problem with Deep Reinforcement Learning Method—0
INGEOTEC at SemEval 2017 Task 4: A B4MSA Ensemble based on Genetic Programming for Twitter Sentiment Analysis—0
Semantic Dependency Parsing via Book Embedding—0
Protein design by multiobjective optimization: evolutionary and non-evolutionary approaches—0
Show:102550
← PrevPage 45 of 52Next →

No leaderboard results yet.