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 576600 of 1277 papers

TitleStatusHype
Dynamic Anisotropic Smoothing for Noisy Derivative-Free Optimization0
Dynamic Algorithms for Matroid Submodular Maximization0
D-Wave's Nonlinear-Program Hybrid Solver: Description and Performance Analysis0
Duality between Feature Selection and Data Clustering0
Bayesian preference elicitation for multiobjective combinatorial optimization0
Doubly Stochastic Matrix Models for Estimation of Distribution Algorithms0
Bayesian Optimization for Macro Placement0
Batch Active Learning via Coordinated Matching0
An Efficient Learning-based Solver Comparable to Metaheuristics for the Capacitated Arc Routing Problem0
Divide and Learn: A Divide and Conquer Approach for Predict+Optimize0
Diversity from Human Feedback0
Barriers for the performance of graph neural networks (GNN) in discrete random structures. A comment on~schuetz2022combinatorial,angelini2023modern,schuetz2023reply0
An Efficient Circuit Compilation Flow for Quantum Approximate Optimization Algorithm0
Distributed Injection-Locking in Analog Ising Machines to Solve Combinatorial Optimizations0
Distributed Deep Reinforcement Learning for Collaborative Spectrum Sharing0
Distributed Combinatorial Optimization of Downlink User Assignment in mmWave Cell-free Massive MIMO Using Graph Neural Networks0
Diseño e implementación de una meta-heurística multi-poblacional de optimización combinatoria enfocada a la resolución de problemas de asignación de rutas a vehículos0
Balancing Pareto Front exploration of Non-dominated Tournament Genetic Algorithm (B-NTGA) in solving multi-objective NP-hard problems with constraints0
An efficient algorithm for learning with semi-bandit feedback0
A Differentiable Approach to Combinatorial Optimization using Dataless Neural Networks0
Accelerating Matroid Optimization through Fast Imprecise Oracles0
Discrete graphical models -- an optimization perspective0
Discrepancy-based Evolutionary Diversity Optimization0
An Efficient Algorithm for Cooperative Semi-Bandits0
DISCO: Efficient Diffusion Solver for Large-Scale Combinatorial Optimization Problems0
Show:102550
← PrevPage 24 of 52Next →

No leaderboard results yet.