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 451–500 of 1277 papers

TitleStatusHype
Clustering Binary Data by Application of Combinatorial Optimization Heuristics—0
An Optimal Quadratic Approach to Monolingual Paraphrase Alignment—0
Exact and heuristic methods for the discrete parallel machine scheduling location problem—0
Exact and Approximate Hierarchical Clustering Using A*—0
Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms—0
Experimental Analysis of Design Elements of Scalarizing Functions-based Multiobjective Evolutionary Algorithms—0
Evolution as a Service: A Privacy-Preserving Genetic Algorithm for Combinatorial Optimization—0
Exploiting Problem Structure in Combinatorial Landscapes: A Case Study on Pure Mathematics Application—0
Exploiting Promising Sub-Sequences of Jobs to solve the No-Wait Flowshop Scheduling Problem—0
Cluster Ensembles --- A Knowledge Reuse Framework for Combining Multiple Partitions—0
Annealing Machine-assisted Learning of Graph Neural Network for Combinatorial Optimization—0
A full-stack view of probabilistic computing with p-bits: devices, architectures and algorithms—0
A Comparative Study of Meta-heuristic Algorithms for Solving Quadratic Assignment Problem—0
A 10.8mW Mixed-Signal Simulated Bifurcation Ising Solver using SRAM Compute-In-Memory with 0.6us Time-to-Solution—0
Evolutionary RL for Container Loading—0
Fair Disaster Containment via Graph-Cut Problems—0
Evolutionary Multi-Objective Algorithms for the Knapsack Problems with Stochastic Profits—0
Chemical Reaction Optimization for the Set Covering Problem—0
Fast Approximations for Job Shop Scheduling: A Lagrangian Dual Deep Learning Method—0
Fast as CHITA: Neural Network Pruning with Combinatorial Optimization—0
Evolutionary Construction of Perfectly Balanced Boolean Functions—0
Evolutionary Bi-objective Optimization for the Dynamic Chance-Constrained Knapsack Problem Based on Tail Bound Objectives—0
Cheaper and Better: Selecting Good Workers for Crowdsourcing—0
Annealed Training for Combinatorial Optimization on Graphs—0
Evolutionary Approach for the Containers Bin-Packing Problem—0
Faster width-dependent algorithm for mixed packing and covering LPs—0
Evaluation of bioinspired algorithms for the solution of the job scheduling problem—0
Fast Hyperparameter Tuning for Ising Machines—0
Chases and Escapes, and Optimization Problems—0
Evaluating Curriculum Learning Strategies in Neural Combinatorial Optimization—0
CHARME: A chain-based reinforcement learning approach for the minor embedding problem—0
Annealed Mean Field Descent Is Highly Effective for Quadratic Unconstrained Binary Optimization—0
A Fitness Landscape View on the Tuning of an Asynchronous Master-Worker EA for Nuclear Reactor Design—0
Estudo comparativo de meta-heurísticas para problemas de colorações de grafos—0
Estimation of the yield curve for Costa Rica using combinatorial optimization metaheuristics applied to nonlinear regression—0
Fewer Truncations Improve Language Modeling—0
Charged particle tracking with quantum annealing-inspired optimization—0
Finding Support Examples for In-Context Learning—0
Assessing Distribution Network Flexibility via Reliability-based P-Q Area Segmentation—0
First-Order Bayesian Regret Analysis of Thompson Sampling—0
An Iterative Path-Breaking Approach with Mutation and Restart Strategies for the MAX-SAT Problem—0
ERL-MPP: Evolutionary Reinforcement Learning with Multi-head Puzzle Perception for Solving Large-scale Jigsaw Puzzles of Eroded Gaps—0
Characterization of Locality in Spin States and Forced Moves for Optimizations—0
Fixed Priority Global Scheduling from a Deep Learning Perspective—0
Chaos inspired Particle Swarm Optimization with Levy Flight for Genome Sequence Assembly—0
An Introduction to Quantum Machine Learning for Engineers—0
A Combinatorial Semi-Bandit Approach to Charging Station Selection for Electric Vehicles—0
Equivariant neural networks for recovery of Hadamard matrices—0
CCJA: Context-Coherent Jailbreak Attack for Aligned Large Language Models—0
Entity Summarization: State of the Art and Future Challenges—0
Show:102550
← PrevPage 10 of 26Next →

No leaderboard results yet.