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

Showing 9761000 of 1277 papers

TitleStatusHype
High-Level Plan for Behavioral Robot Navigation with Natural Language Directions and R-NET0
Clustering Binary Data by Application of Combinatorial Optimization Heuristics0
Learning fine-grained search space pruning and heuristics for combinatorial optimization0
A Probability Density Theory for Spin-Glass Systems0
An adaptive simulated annealing EM algorithm for inference on non-homogeneous hidden Markov modelsCode0
Provable Non-Convex Optimization and Algorithm Validation via Submodularity0
Estudo comparativo de meta-heurísticas para problemas de colorações de grafos0
Quantum-inspired annealers as Boltzmann generators for machine learning and statistical physics0
Theory of neuromorphic computing by waves: machine learning by rogue waves, dispersive shocks, and solitons0
Protecting Geolocation Privacy of Photo CollectionsCode0
Learning to Dynamically Coordinate Multi-Robot Teams in Graph Attention Networks0
Improved Regret Bounds for Bandit Combinatorial Optimization0
Neural Graph Matching Network: Learning Lawler's Quadratic Assignment Problem with Extension to Hypergraph and Multiple-graph Matching0
Learning to Optimize Variational Quantum Circuits to Solve Combinatorial ProblemsCode0
Smart Predict-and-Optimize for Hard Combinatorial Optimization ProblemsCode0
Estimation of the yield curve for Costa Rica using combinatorial optimization metaheuristics applied to nonlinear regression0
Black-box Combinatorial Optimization using Models with Integer-valued MinimaCode0
Multi-objectivization Inspired Metaheuristics for the Sum-of-the-Parts Combinatorial Optimization Problems0
Multidataset Independent Subspace Analysis with Application to Multimodal FusionCode0
Self-Assignment Flows for Unsupervised Data Labeling on Graphs0
Learning to Order Graph Elements with Application to Multilingual Surface Realization0
Word-level Textual Adversarial Attacking as Combinatorial OptimizationCode0
Kernels of Mallows Models under the Hamming Distance for solving the Quadratic Assignment ProblemCode0
A Memetic Algorithm Based on Breakout Local Search for the Generalized Travelling Salesman Problem0
Entity Summarization: State of the Art and Future Challenges0
Show:102550
← PrevPage 40 of 52Next →

No leaderboard results yet.