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 851–900 of 1277 papers

TitleStatusHype
Twin Sorting Dynamic Programming Assisted User Association and Wireless Bandwidth Allocation for Hierarchical Federated Learning—0
Two-Dimensional Phase Unwrapping via Balanced Spanning Forests—0
Two-Stage Learning For the Flexible Job Shop Scheduling Problem—0
UAV Trajectory Planning in Wireless Sensor Networks for Energy Consumption Minimization by Deep Reinforcement Learning—0
Bridging Large Language Models and Optimization: A Unified Framework for Text-attributed Combinatorial Optimization—0
UniCO: Towards a Unified Model for Combinatorial Optimization Problems—0
Unrealized Expectations: Comparing AI Methods vs Classical Algorithms for Maximum Independent Set—0
Unsupervised Learning for Quadratic Assignment—0
Unveiling the Lexical Sensitivity of LLMs: Combinatorial Optimization for Prompt Enhancement—0
Unveiling the Limits of Learned Local Search Heuristics: Are You the Mightiest of the Meek?—0
User Assignment and Resource Allocation for Hierarchical Federated Learning over Wireless Networks—0
Using Combinatorial Optimization to Design a High quality LLM Solution—0
Using Tabu Search Algorithm for Map Generation in the Terra Mystica Tabletop Game—0
Utilizing synchronization to partition power networks into microgrids—0
Explainable quantum regression algorithm with encoded data structure—0
Versatile Black-Box Optimization—0
Virtual Savant: learning for optimization—0
VN-Solver: Vision-based Neural Solver for Combinatorial Optimization over Graphs—0
VRSD: Rethinking Similarity and Diversity for Retrieval in Large Language Models—0
Vulcan: Solving the Steiner Tree Problem with Graph Neural Networks and Deep Reinforcement Learning—0
WeaveNet: A Differentiable Solver for Non-linear Assignment Problems—0
What’s Wrong with Deep Learning in Tree Search for Combinatorial Optimization—0
When can l_p-norm objective functions be minimized via graph cuts?—0
WiSM: Windowing Surrogate Model for Evaluation of Curvature-Constrained Tours with Dubins vehicle—0
XKV: Personalized KV Cache Memory Reduction for Long-Context LLM Inference—0
XPrompt:Explaining Large Language Model's Generation via Joint Prompt Attribution—0
YaoGAN: Learning Worst-case Competitive Algorithms from Self-generated Inputs—0
Yordle: An Efficient Imitation Learning for Branch and Bound—0
Robust Metric Learning by Smooth Optimization—0
Zero Training Overhead Portfolios for Learning to Solve Combinatorial Problems—0
A Time-Dependent TSP Formulation for the Design of an Active Debris Removal Mission using Simulated Annealing—0
Domain Switching on the Pareto Front: Multi-Objective Deep Kernel Learning in Automated Piezoresponse Force Microscopy—0
Systematic and Efficient Construction of Quadratic Unconstrained Binary Optimization Forms for High-order and Dense Interactions—0
A 10.8mW Mixed-Signal Simulated Bifurcation Ising Solver using SRAM Compute-In-Memory with 0.6us Time-to-Solution—0
A 2-approximation algorithm for the softwired parsimony problem on binary, tree-child phylogenetic networks—0
A2Perf: Real-World Autonomous Agents Benchmark—0
A Bayesian approach for prompt optimization in pre-trained language models—0
A Bayesian framework for functional calibration of expensive computational models through non-isometric matching—0
A Branch-and-Bound Algorithm for Checkerboard Extraction in Camera-Laser Calibration—0
A case study of algorithm selection for the traveling thief problem—0
Accelerating Diffusion-based Combinatorial Optimization Solvers by Progressive Distillation—0
Accelerating E-Commerce Search Engine Ranking by Contextual Factor Selection—0
Accelerating Evolutionary Construction Tree Extraction via Graph Partitioning—0
Accelerating Exact Combinatorial Optimization via RL-based Initialization -- A Case Study in Scheduling—0
Accelerating Matroid Optimization through Fast Imprecise Oracles—0
Accelerating Quantum Approximate Optimization Algorithm using Machine Learning—0
Accelerating Vehicle Routing via AI-Initialized Genetic Algorithms—0
A Class of Linear Programs Solvable by Coordinate-Wise Minimization—0
A Combinatorial Semi-Bandit Approach to Charging Station Selection for Electric Vehicles—0
A Comparative Study of Meta-heuristic Algorithms for Solving Quadratic Assignment Problem—0
Show:102550
← PrevPage 18 of 26Next →

No leaderboard results yet.