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

TitleStatusHype
On Circuit Depth Scaling For Quantum Approximate Optimization0
Multi-objective Pointer Network for Combinatorial OptimizationCode0
Deep Reinforcement Learning for Online Routing of Unmanned Aerial Vehicles with Wireless Power Transfer0
Smoothed Online Combinatorial Optimization Using Imperfect Predictions0
New Core-Guided and Hitting Set Algorithms for Multi-Objective Combinatorial Optimization0
Optimizing Tensor Network Contraction Using Reinforcement Learning0
Optimal Intermittent Particle FilterCode0
Application of QUBO solver using black-box optimization to structural design for resonance avoidance0
Energy-Sensitive Trajectory Design and Restoration Areas Allocation for UAV-Enabled Grassland Restoration0
Learning to solve Minimum Cost Multicuts efficiently using Edge-Weighted Graph Convolutional Neural Networks0
Data-driven Prediction of Relevant Scenarios for Robust Combinatorial Optimization0
A Distribution Evolutionary Algorithm for the Graph Coloring Problem0
MolGenSurvey: A Systematic Survey in Machine Learning Models for Molecule Design0
Focused Jump-and-Repair Constraint Handling for Fixed-Parameter Tractable Graph Problems Closed Under Induced Subgraphs0
Optimizing Camera Placements for Overlapped Coverage with 3D Camera Projections0
A Simple and Computationally Trivial Estimator for Grouped Fixed Effects Models0
A Differentiable Approach to Combinatorial Optimization using Dataless Neural Networks0
A Compositional Algorithm for the Conflict-Free Electric Vehicle Routing Problem0
Set-valued prediction in hierarchical classification with constrained representation complexity0
A Survey for Solving Mixed Integer Programming via Machine Learning0
Combining Reinforcement Learning and Optimal Transport for the Traveling Salesman ProblemCode0
A Data-Driven Column Generation Algorithm For Bin Packing Problem in Manufacturing Industry0
Learning to Schedule Heuristics for the Simultaneous Stochastic Optimization of Mining Complexes0
Noncoherent Massive MIMO with Embedded One-Way Function Physical Layer Security0
Reinforcement Learning in Practice: Opportunities and Challenges0
Reinforcement Learning Framework for Server Placement and Workload Allocation in Multi-Access Edge Computing0
Evolutionary Construction of Perfectly Balanced Boolean Functions0
Understanding Curriculum Learning in Policy Optimization for Online Combinatorial OptimizationCode0
Feature subset selection for Big Data via Chaotic Binary Differential Evolution under Apache Spark0
Exploring the Feature Space of TSP Instances Using Quality Diversity0
Heed the Noise in Performance Evaluations in Neural Architecture Search0
Yordle: An Efficient Imitation Learning for Branch and Bound0
MGNN: Graph Neural Networks Inspired by Distance Geometry ProblemCode0
Equivariant neural networks for recovery of Hadamard matrices0
Classical Simulation of Variational Quantum Classifiers using Tensor Rings0
An Improved Reinforcement Learning Algorithm for Learning to Branch0
Recent Advances in Deep Learning for Routing Problems0
Reinforcement Learning to Solve NP-hard Problems: an Application to the CVRP0
A Quadratic 0-1 Programming Approach for Word Sense Disambiguation0
Supervised Permutation Invariant Networks for Solving the CVRP with Bounded Fleet Size0
Neural combinatorial optimization beyond the TSP: Existing architectures under-represent graph structure0
A General Framework for Evaluating Robustness of Combinatorial Optimization Solvers on Graphs0
DeepGANTT: A Scalable Deep Learning Scheduler for Backscatter Networks0
An Efficient Combinatorial Optimization Model Using Learning-to-Rank DistillationCode0
Revisiting Transformation Invariant Geometric Deep Learning: Are Initial Representations All You Need?0
ML4CO: Is GCNN All You Need? Graph Convolutional Neural Networks Produce Strong Baselines For Combinatorial Optimization Problems, If Tuned and Trained Properly, on Appropriate Data0
Noise-injected analog Ising machines enable ultrafast statistical sampling and machine learning0
Learning for Robust Combinatorial Optimization: Algorithm and Application0
Pretrained Cost Model for Distributed Constraint Optimization ProblemsCode0
Constrained Resource Allocation Problems in Communications: An Information-assisted Approach0
Show:102550
← PrevPage 15 of 26Next →

No leaderboard results yet.