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

TitleStatusHype
Local Branching Relaxation Heuristics for Integer Linear Programs—0
Local Optimal Sets and Bounded Archiving on Multi-objective NK-Landscapes with Correlated Objectives—0
Local Perturb-and-MAP for Structured Prediction—0
New Characterizations and Efficient Local Search for General Integer Linear Programming—0
Logically Synthesized, Hardware-Accelerated, Restricted Boltzmann Machines for Combinatorial Optimization and Integer Factorization—0
Long Term Memory Network for Combinatorial Optimization Problems—0
Low-Rank Extragradient Methods for Scalable Semidefinite Optimization—0
LRM-1B: Towards Large Routing Model—0
Machine Learning and Constraint Programming for Efficient Healthcare Scheduling—0
Machine Learning-assisted High-speed Combinatorial Optimization with Ising Machines for Dynamically Changing Problems—0
Machine Learning for Combinatorial Optimization: a Methodological Tour d'Horizon—0
Machine Learning for the Multi-Dimensional Bin Packing Problem: Literature Review and Empirical Evaluation—0
Machine Learning Methods for Data Association in Multi-Object Tracking—0
MAG-GNN: Reinforcement Learning Boosted Graph Neural Network—0
A Simple and Computationally Trivial Estimator for Grouped Fixed Effects Models—0
Making Sense Of Distributed Representations With Activation Spectroscopy—0
Manipulating Predictions over Discrete Inputs in Machine Teaching—0
Mapping Tractography Across Subjects—0
Material Identification From Radiographs Without Energy Resolution—0
Mathematical Programming Strategies for Solving the Minimum Common String Partition Problem—0
Matroid Bandits: Fast Combinatorial Optimization with Learning—0
Maximizing Non-Monotone DR-Submodular Functions with Cardinality Constraints—0
Maximizing Submodular or Monotone Approximately Submodular Functions by Multi-objective Evolutionary Algorithms—0
Max-Product Belief Propagation for Linear Programming: Applications to Combinatorial Optimization—0
MBL-CPDP: A Multi-objective Bilevel Method for Cross-Project Defect Prediction via Automated Machine Learning—0
Show:102550
← PrevPage 37 of 52Next →

No leaderboard results yet.