Combinatorial Optimization

Description from the archive archive 2025-07-28.

Benchmarks archive 2025-07-28

No benchmark for this task in the archive.

Libraries

Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.

Datasets archive 2025-07-28

3 datasets whose archive record lists this task, ordered by the archive's paper count.

Subtasks archive 2025-07-28

No subtask under this task in the archive's task tree.

Most implemented papers archive 2025-07-28

30 shown of 401 papers with code (1,277 tagged with this task in all), ordered by repositories listed in the archive, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers without a page here are shown as plain text.

• Pointer Networks
  9 Jun 2015 21 repositories listed Syntology ran 9 of 23 samples · 14 unverified · 7 pointer-only (licence)
  It differs from the previous attention attempts in that, instead of using attention to blend hidden units of an encoder to a context vector at each decoder step, it uses attention as a pointer to select a member of the…
• Attention, Learn to Solve Routing Problems!
  22 Mar 2018 15 repositories listed Syntology ran 14 of 40 samples · 26 unverified · 3 pointer-only (licence)
  The recently presented idea to learn heuristics for combinatorial optimization problems is promising as it can save costly development.
• Neural Combinatorial Optimization with Reinforcement Learning
  29 Nov 2016 10 repositories listed Syntology ran 6 of 20 samples · 14 unverified · 5 pointer-only (licence)
  Despite the computational expense, without much engineering and heuristic designing, Neural Combinatorial Optimization achieves close to optimal results on 2D Euclidean graphs with up to 100 nodes.
• Solving the Rubik's Cube Without Human Knowledge
  18 May 2018 9 repositories listed Syntology ran 4 of 4 samples · 0 unverified · 4 pointer-only (licence)
  A generally intelligent agent must be able to teach itself how to solve problems in complex domains with minimal human supervision.
• Learning Combinatorial Optimization Algorithms over Graphs
  5 Apr 2017 8 repositories listed Syntology ran 2 of 2 samples · 0 unverified · 2 pointer-only (licence)
  The design of good heuristics or approximation algorithms for NP-hard combinatorial optimization problems often requires significant specialized knowledge and trial-and-error.
• Evolution of Heuristics: Towards Efficient Automatic Algorithm Design Using Large Language Model
  4 Jan 2024 6 repositories listed Syntology ran 1 of 1 samples · 0 unverified
  EoH represents the ideas of heuristics in natural language, termed thoughts.
• Exact Combinatorial Optimization with Graph Convolutional Neural Networks
  4 Jun 2019 6 repositories listed Syntology ran 0 of 2 samples · 2 unverified · 1 pointer-only (licence)
  Combinatorial optimization problems are typically tackled by the branch-and-bound paradigm.
• Learning with Combinatorial Optimization Layers: a Probabilistic Approach
  27 Jul 2022 5 repositories listed
  We demonstrate its abilities using a pathfinding problem on video game maps as guiding example, as well as three other applications from operations research.
• DevFormer: A Symmetric Transformer for Context-Aware Device Placement
  26 May 2022 5 repositories listed Syntology ran 13 of 23 samples · 10 unverified
  In this paper, we present DevFormer, a novel transformer-based architecture for addressing the complex and computationally demanding problem of hardware design optimization.
• Deep Graph Matching via Blackbox Differentiation of Combinatorial Solvers
  25 Mar 2020 5 repositories listed Syntology ran 5 of 11 samples · 6 unverified · 3 pointer-only (licence)
  Building on recent progress at the intersection of combinatorial optimization and deep learning, we propose an end-to-end trainable architecture for deep graph matching that contains unmodified combinatorial solvers.
• Efficient Active Search for Combinatorial Optimization Problems
  9 Jun 2021 4 repositories listed Syntology ran 0 of 1 samples · 1 unverified · 1 pointer-only (licence)
  While active search is simple to implement, it is not competitive with state-of-the-art methods because adjusting all model weights for each test instance is very time and memory intensive.
• A Reinforcement Learning Environment For Job-Shop Scheduling
  8 Apr 2021 4 repositories listed
  Scheduling is a fundamental task occurring in various automated systems applications, e.
• Learning the Travelling Salesperson Problem Requires Rethinking Generalization
  12 Jun 2020 4 repositories listed Syntology ran 3 of 7 samples · 4 unverified
  End-to-end training of neural network solvers for graph combinatorial optimization problems such as the Travelling Salesperson Problem (TSP) have seen a surge of interest recently, but remain intractable and inefficient…
• Memory Augmented Policy Optimization for Program Synthesis and Semantic Parsing
  6 Jul 2018 4 repositories listed Syntology ran 0 of 15 samples · 15 unverified
  We present Memory Augmented Policy Optimization (MAPO), a simple and novel way to leverage a memory buffer of promising trajectories to reduce the variance of policy gradient estimate.
• Reinforcement Learning for Solving the Vehicle Routing Problem
  12 Feb 2018 4 repositories listed Syntology ran 3 of 3 samples · 0 unverified · 3 pointer-only (licence)
  Our model represents a parameterized stochastic policy, and by applying a policy gradient algorithm to optimize its parameters, the trained model produces the solution as a sequence of consecutive actions in real time,…
• DataSculpt: Crafting Data Landscapes for Long-Context LLMs through Multi-Objective Partitioning
  2 Sep 2024 3 repositories listed
  Through extensive experimental analysis, we identified three key challenges in designing effective data management strategies that enable the model to achieve long-context capability without sacrificing performance in…
• ReEvo: Large Language Models as Hyper-Heuristics with Reflective Evolution
  2 Feb 2024 3 repositories listed Syntology ran 5 of 10 samples · 5 unverified
  The omnipresence of NP-hard combinatorial optimization problems (COPs) compels domain experts to engage in trial-and-error heuristic design.
• RL4CO: an Extensive Reinforcement Learning for Combinatorial Optimization Benchmark
  29 Jun 2023 3 repositories listed Syntology ran 0 of 16 samples · 16 unverified · 3 pointer-only (licence)
  To fill this gap, we introduce RL4CO, a unified and extensive benchmark with in-depth library coverage of 23 state-of-the-art methods and more than 20 CO problems.
• Combinatorial Optimization with Physics-Inspired Graph Neural Networks
  2 Jul 2021 3 repositories listed
  Combinatorial optimization problems are pervasive across science and industry.
• Implicit MLE: Backpropagating Through Discrete Exponential Family Distributions
  3 Jun 2021 3 repositories listed Syntology ran 7 of 10 samples · 3 unverified · 6 pointer-only (licence)
  We propose Implicit Maximum Likelihood Estimation (I-MLE), a framework for end-to-end learning of models combining discrete exponential family distributions and differentiable neural components.
• POMO: Policy Optimization with Multiple Optima for Reinforcement Learning
  30 Oct 2020 3 repositories listed Syntology ran 1 of 8 samples · 7 unverified · 8 pointer-only (licence)
  We introduce Policy Optimization with Multiple Optima (POMO), an end-to-end approach for building such a heuristic solver.
• A Deep Reinforcement Learning Algorithm Using Dynamic Attention Model for Vehicle Routing Problems
  9 Feb 2020 3 repositories listed
  However, the fact is, the state of an instance is changed according to the decision that the model made at different construction steps, and the node features should be updated correspondingly.
• XXᵗ Can Be Faster
  14 May 2025 2 repositories listed
  We present RXTX, a new algorithm for computing the product of matrix by its transpose XXᵗ for X∈ℝ^(n×m).
• Learning to Solve Combinatorial Optimization under Positive Linear Constraints via Non-Autoregressive Neural Networks
  6 Sep 2024 2 repositories listed Syntology ran 6 of 7 samples · 1 unverified · 7 pointer-only (licence)
  In this paper, we design a family of non-autoregressive neural networks to solve CO problems under positive linear constraints with the following merits.
• Parallel AutoRegressive Models for Multi-Agent Combinatorial Optimization
  5 Sep 2024 2 repositories listed Syntology ran 2 of 4 samples · 2 unverified
  To address these issues, we propose Parallel AutoRegressive Combinatorial Optimization (PARCO), a reinforcement learning framework designed to construct high-quality solutions for multi-agent combinatorial tasks…
• UDC: A Unified Neural Divide-and-Conquer Framework for Large-Scale Combinatorial Optimization Problems
  29 Jun 2024 2 repositories listed
  Employing a high-efficiency Graph Neural Network (GNN) for global instance dividing and a fixed-length sub-path solver for conquering divided sub-problems, the proposed UDC framework demonstrates extensive…
• Joint Admission Control and Resource Allocation of Virtual Network Embedding via Hierarchical Deep Reinforcement Learning
  25 Jun 2024 2 repositories listed Syntology ran 3 of 7 samples · 4 unverified · 7 pointer-only (licence)
  Specifically, the whole VNE process is decomposed into an upper-level policy for deciding whether to admit the arriving VNR or not and a lower-level policy for allocating resources of the physical network to meet the…
• Distributional MIPLIB: a Multi-Domain Library for Advancing ML-Guided MILP Methods
  11 Jun 2024 2 repositories listed Syntology ran 5 of 6 samples · 1 unverified
  We curate MILP distributions from existing work in this area as well as real-world problems that have not been used, and classify them into different hardness levels.
• Tackling Prevalent Conditions in Unsupervised Combinatorial Optimization: Cardinality, Minimum, Covering, and More
  14 May 2024 2 repositories listed Syntology ran 4 of 7 samples · 3 unverified · 3 pointer-only (licence)
  Then, for various conditions commonly involved in different CO problems, we derive nontrivial objectives and derandomization to meet the targets.
• MVMoE: Multi-Task Vehicle Routing Solver with Mixture-of-Experts
  2 May 2024 2 repositories listed Syntology ran 4 of 5 samples · 1 unverified
  Learning to solve vehicle routing problems (VRPs) has garnered much attention.

Syntology lines on 23 of the papers shown; no Syntology record for the others (a paper without an arXiv id cannot be joined to the graph, and absence from the graph layer is not a recorded non-run). “Ran” means the sample executed on a synthesized fixture, not that the paper's result was reproduced. Read from the graph 2026-09-24.