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

TitleStatusHype
Symmetry Breaking and Equivariant Neural Networks—0
Synergizing Reinforcement Learning and Genetic Algorithms for Neural Combinatorial Optimization—0
Synthesizing Min-Max Control Barrier Functions For Switched Affine Systems—0
Synthetic Principal Component Design: Fast Covariate Balancing with Synthetic Controls—0
Target Languages (vs. Inductive Biases) for Learning to Act and Plan—0
Classical Simulation of Variational Quantum Classifiers using Tensor Rings—0
Text2Zinc: A Cross-Domain Dataset for Modeling Optimization and Satisfaction Problems in MiniZinc—0
The backtracking survey propagation algorithm for solving random K-SAT problems—0
The Cakewalk Method—0
The Effectiveness of Johnson-Lindenstrauss Transform for High Dimensional Optimization With Adversarial Outliers, and the Recovery—0
The Fellowship of the Dyson Ring: ACT&Friends' Results and Methods for GTOC 11—0
The First Proven Performance Guarantees for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II) on a Combinatorial Optimization Problem—0
The Hardness Analysis of Thompson Sampling for Combinatorial Semi-bandits with Greedy Oracle—0
The Influence of Local Search over Genetic Algorithms with Balanced Representations—0
The Lovász ϑ function, SVMs and finding large dense subgraphs—0
The Neural-Prediction based Acceleration Algorithm of Column Generation for Graph-Based Set Covering Problems—0
Theoretically Grounded Pruning of Large Ground Sets for Constrained, Discrete Optimization—0
Theory of neuromorphic computing by waves: machine learning by rogue waves, dispersive shocks, and solitons—0
Thinking Out of the Box: Hybrid SAT Solving by Unconstrained Continuous Optimization—0
Thompson Sampling for Combinatorial Network Optimization in Unknown Environments—0
Three-dimensional Cooperative Localization of Commercial-Off-The-Shelf Sensors—0
Threshold-aware Learning to Generate Feasible Solutions for Mixed Integer Programs—0
Tight Bounds for Bandit Combinatorial Optimization—0
Tight Bounds on Low-degree Spectral Concentration of Submodular and XOS functions—0
Time Complexity Analysis of Evolutionary Algorithms for 2-Hop (1,2)-Minimum Spanning Tree Problem—0
Show:102550
← PrevPage 33 of 52Next →

No leaderboard results yet.