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

TitleStatusHype
Iterated Tabu Search Algorithm for Packing Unequal Circles in a Circle—0
Evolutionary Approach for the Containers Bin-Packing Problem—0
Towards Efficient and Exact MAP-Inference for Large Scale Discrete Computer Vision Problems via Combinatorial Optimization—0
Efficient 3D Endfiring TRUS Prostate Segmentation with Globally Optimized Rotational Symmetry—0
An efficient algorithm for learning with semi-bandit feedback—0
A Discrete State Transition Algorithm for Generalized Traveling Salesman Problem—0
Improvement/Extension of Modular Systems as Combinatorial Reengineering (Survey)—0
An Improved ACS Algorithm for the Solutions of Larger TSP Problems—0
Note on Combinatorial Engineering Frameworks for Hierarchical Modular Systems—0
Detecting Overlapping Temporal Community Structure in Time-Evolving Networks—0
The Lovász ϑ function, SVMs and finding large dense subgraphs—0
A Unifying Survey of Reinforced, Sensitive and Stigmergic Agent-Based Approaches for E-GTSP—0
On Amortizing Inference Cost for Structured Prediction—0
Batch Active Learning via Coordinated Matching—0
A Comparison of Greedy and Optimal Assessment of Natural Language Student Input Using Word-to-Word Similarity Metrics—0
Implicitly Intersecting Weighted Automata using Dual Decomposition—0
Optimized Online Rank Learning for Machine Translation—0
Regret in Online Combinatorial OptimizationCode0
Robust Metric Learning by Smooth Optimization—0
A Polynomial Time Approximation Scheme for a Single Machine Scheduling Problem Using a Hybrid Evolutionary Algorithm—0
Learning with Submodular Functions: A Convex Optimization Perspective—0
Ant Colony Optimization and Hypergraph Covering Problems—0
Active Instance Sampling via Matrix Partition—0
Combinatorial Network Optimization with Unknown Variables: Multi-Armed Bandits with Linear Rewards—0
DIFFRAC: a discriminative and flexible framework for clustering—0
Cluster Ensembles --- A Knowledge Reuse Framework for Combining Multiple Partitions—0
Optimization by Simulated AnnealingCode0
Show:102550
← PrevPage 26 of 26Next →

No leaderboard results yet.