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

TitleStatusHype
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
The Exact Solution to Rank-1 L1-norm TUCKER2 DecompositionCode0
Deep Learning as a Mixed Convex-Combinatorial Optimization ProblemCode0
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
Protein design by multiobjective optimization: evolutionary and non-evolutionary approaches—0
Joint Graph Decomposition & Node Labeling: Problem, Algorithms, Applications—0
Semantic Dependency Parsing via Book Embedding—0
Population-specific design of de-immunized protein biotherapeutics—0
Recommendations for Marketing Campaigns in Telecommunication Business based on the footprint analysis—0
Quadratic Unconstrained Binary Optimization Problem Preprocessing: Theory and Empirical AnalysisCode0
End-to-end Planning of Fixed Millimeter-Wave Networks—0
Hierarchical Clustering: Objective Functions and Algorithms—0
Learning Combinatorial Optimization Algorithms over GraphsCode0
A Branch-and-Bound Algorithm for Checkerboard Extraction in Camera-Laser Calibration—0
Experimental Analysis of Design Elements of Scalarizing Functions-based Multiobjective Evolutionary Algorithms—0
Métodos de Otimização Combinatória Aplicados ao Problema de Compressão MultiFrases—0
On Approximation Guarantees for Greedy Low Rank Optimization—0
A Knowledge-Based Approach to Word Sense Disambiguation by distributional selection and semantic features—0
Tight Bounds for Bandit Combinatorial Optimization—0
A Hybrid Evolutionary Algorithm Based on Solution Merging for the Longest Arc-Preserving Common Subsequence Problem—0
Shape Estimation from Defocus Cue for Microscopy Images via Belief Propagation—0
Solving Combinatorial Optimization problems with Quantum inspired Evolutionary Algorithm Tuned using a Novel Heuristic Method—0
Neural Combinatorial Optimization with Reinforcement LearningCode1
Maximizing Non-Monotone DR-Submodular Functions with Cardinality Constraints—0
Joint Graph Decomposition and Node Labeling: Problem, Algorithms, ApplicationsCode0
Recursive Decomposition for Nonconvex Optimization—0
Heuristic with elements of tabu search for Truck and Trailer Routing Problem—0
Duality between Feature Selection and Data Clustering—0
On the Mathematical Relationship between Expected n-call@k and the Relevance vs. Diversity Trade-off—0
A Tutorial about Random Neural Networks in Supervised Learning—0
A Generic Bet-and-run Strategy for Speeding Up Traveling Salesperson and Minimum Vertex Cover—0
A case study of algorithm selection for the traveling thief problem—0
MindX: Denoising Mixed Impulse Poisson-Gaussian Noise Using Proximal Algorithms—0
Parameter Learning for Log-supermodular Distributions—0
How to calculate partition functions using convex programming hierarchies: provable bounds for variational methods—0
Pruning Random Forests for Prediction on a Budget—0
Show:102550
← PrevPage 23 of 26Next →

No leaderboard results yet.