{"url":"/task/combinatorial-optimization","name":"Combinatorial Optimization","slug":"combinatorial-optimization","description_markdown":"**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.\n\n\n<span class=\"description-source\">Source: [Recent Advances in Neural Program Synthesis ](https://arxiv.org/abs/1802.02353)</span>","categories":[{"name":"Methodology","url":"/area/methodology"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":1277,"papers_with_code":401,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":3,"subtasks":0,"parent_tasks":0},"benchmarks":[],"datasets":[{"url":"/dataset/memetracker","name":"MemeTracker","full_name":"MemeTracker","num_papers_in_archive":39},{"url":"/dataset/cvrptw","name":"CVRPTW","full_name":"","num_papers_in_archive":7},{"url":"/dataset/distributional-miplib","name":"Distributional MIPLIB","full_name":"","num_papers_in_archive":3}],"subtasks":[],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (desc), then date (desc); the archive holds no stars","population":"papers tagged with this task that list at least one repository in the archive","shown":30,"of":401,"tagged_in_all":1277,"items":[{"url":"/paper/pointer-networks","title":"Pointer Networks","date":"2015-06-09","arxiv_id":"1506.03134","repositories_listed":21,"syntology":{"n":23,"n_ran":9,"n_unverified":14,"n_pointer_only":7}},{"url":"/paper/attention-learn-to-solve-routing-problems","title":"Attention, Learn to Solve Routing Problems!","date":"2018-03-22","arxiv_id":"1803.08475","repositories_listed":15,"syntology":{"n":40,"n_ran":14,"n_unverified":26,"n_pointer_only":3}},{"url":"/paper/neural-combinatorial-optimization-with","title":"Neural Combinatorial Optimization with Reinforcement Learning","date":"2016-11-29","arxiv_id":"1611.09940","repositories_listed":10,"syntology":{"n":20,"n_ran":6,"n_unverified":14,"n_pointer_only":5}},{"url":"/paper/solving-the-rubiks-cube-without-human","title":"Solving the Rubik's Cube Without Human Knowledge","date":"2018-05-18","arxiv_id":"1805.07470","repositories_listed":9,"syntology":{"n":4,"n_ran":4,"n_unverified":0,"n_pointer_only":4}},{"url":"/paper/learning-combinatorial-optimization","title":"Learning Combinatorial Optimization Algorithms over Graphs","date":"2017-04-05","arxiv_id":"1704.01665","repositories_listed":8,"syntology":{"n":2,"n_ran":2,"n_unverified":0,"n_pointer_only":2}},{"url":"/paper/an-example-of-evolutionary-computation-large","title":"Evolution of Heuristics: Towards Efficient Automatic Algorithm Design Using Large Language Model","date":"2024-01-04","arxiv_id":"2401.02051","repositories_listed":6,"syntology":{"n":1,"n_ran":1,"n_unverified":0,"n_pointer_only":0}},{"url":"/paper/exact-combinatorial-optimization-with-graph","title":"Exact Combinatorial Optimization with Graph Convolutional Neural Networks","date":"2019-06-04","arxiv_id":"1906.01629","repositories_listed":6,"syntology":{"n":2,"n_ran":0,"n_unverified":2,"n_pointer_only":1}},{"url":"/paper/learning-with-combinatorial-optimization","title":"Learning with Combinatorial Optimization Layers: a Probabilistic Approach","date":"2022-07-27","arxiv_id":"2207.13513","repositories_listed":5,"syntology":null},{"url":"/paper/collaborative-distillation-meta-learning-for","title":"DevFormer: A Symmetric Transformer for Context-Aware Device Placement","date":"2022-05-26","arxiv_id":"2205.13225","repositories_listed":5,"syntology":{"n":23,"n_ran":13,"n_unverified":10,"n_pointer_only":0}},{"url":"/paper/deep-graph-matching-via-blackbox","title":"Deep Graph Matching via Blackbox Differentiation of Combinatorial Solvers","date":"2020-03-25","arxiv_id":"2003.11657","repositories_listed":5,"syntology":{"n":11,"n_ran":5,"n_unverified":6,"n_pointer_only":3}},{"url":"/paper/efficient-active-search-for-combinatorial","title":"Efficient Active Search for Combinatorial Optimization Problems","date":"2021-06-09","arxiv_id":"2106.05126","repositories_listed":4,"syntology":{"n":1,"n_ran":0,"n_unverified":1,"n_pointer_only":1}},{"url":"/paper/a-reinforcement-learning-environment-for-job","title":"A Reinforcement Learning Environment For Job-Shop Scheduling","date":"2021-04-08","arxiv_id":"2104.03760","repositories_listed":4,"syntology":null},{"url":"/paper/learning-tsp-requires-rethinking","title":"Learning the Travelling Salesperson Problem Requires Rethinking Generalization","date":"2020-06-12","arxiv_id":"2006.07054","repositories_listed":4,"syntology":{"n":7,"n_ran":3,"n_unverified":4,"n_pointer_only":0}},{"url":"/paper/memory-augmented-policy-optimization-for","title":"Memory Augmented Policy Optimization for Program Synthesis and Semantic Parsing","date":"2018-07-06","arxiv_id":"1807.02322","repositories_listed":4,"syntology":{"n":15,"n_ran":0,"n_unverified":15,"n_pointer_only":0}},{"url":"/paper/reinforcement-learning-for-solving-the","title":"Reinforcement Learning for Solving the Vehicle Routing Problem","date":"2018-02-12","arxiv_id":"1802.04240","repositories_listed":4,"syntology":{"n":3,"n_ran":3,"n_unverified":0,"n_pointer_only":3}},{"url":"/paper/datasculpt-crafting-data-landscapes-for-llm","title":"DataSculpt: Crafting Data Landscapes for Long-Context LLMs through Multi-Objective Partitioning","date":"2024-09-02","arxiv_id":"2409.00997","repositories_listed":3,"syntology":null},{"url":"/paper/reevo-large-language-models-as-hyper","title":"ReEvo: Large Language Models as Hyper-Heuristics with Reflective Evolution","date":"2024-02-02","arxiv_id":"2402.01145","repositories_listed":3,"syntology":{"n":10,"n_ran":5,"n_unverified":5,"n_pointer_only":0}},{"url":"/paper/rl4co-an-extensive-reinforcement-learning-for","title":"RL4CO: an Extensive Reinforcement Learning for Combinatorial Optimization Benchmark","date":"2023-06-29","arxiv_id":"2306.17100","repositories_listed":3,"syntology":{"n":16,"n_ran":0,"n_unverified":16,"n_pointer_only":3}},{"url":"/paper/combinatorial-optimization-with-physics","title":"Combinatorial Optimization with Physics-Inspired Graph Neural Networks","date":"2021-07-02","arxiv_id":"2107.01188","repositories_listed":3,"syntology":null},{"url":"/paper/implicit-mle-backpropagating-through-discrete","title":"Implicit MLE: Backpropagating Through Discrete Exponential Family Distributions","date":"2021-06-03","arxiv_id":"2106.01798","repositories_listed":3,"syntology":{"n":10,"n_ran":7,"n_unverified":3,"n_pointer_only":6}},{"url":"/paper/pomo-policy-optimization-with-multiple-optima","title":"POMO: Policy Optimization with Multiple Optima for Reinforcement Learning","date":"2020-10-30","arxiv_id":"2010.16011","repositories_listed":3,"syntology":{"n":8,"n_ran":1,"n_unverified":7,"n_pointer_only":8}},{"url":"/paper/a-deep-reinforcement-learning-algorithm-using","title":"A Deep Reinforcement Learning Algorithm Using Dynamic Attention Model for Vehicle Routing Problems","date":"2020-02-09","arxiv_id":"2002.03282","repositories_listed":3,"syntology":null},{"url":"/paper/xx-t-can-be-faster","title":"$XX^{t}$ Can Be Faster","date":"2025-05-14","arxiv_id":"2505.09814","repositories_listed":2,"syntology":null},{"url":"/paper/learning-to-solve-combinatorial-optimization-1","title":"Learning to Solve Combinatorial Optimization under Positive Linear Constraints via Non-Autoregressive Neural Networks","date":"2024-09-06","arxiv_id":"2409.04495","repositories_listed":2,"syntology":{"n":7,"n_ran":6,"n_unverified":1,"n_pointer_only":7}},{"url":"/paper/parco-learning-parallel-autoregressive","title":"Parallel AutoRegressive Models for Multi-Agent Combinatorial Optimization","date":"2024-09-05","arxiv_id":"2409.03811","repositories_listed":2,"syntology":{"n":4,"n_ran":2,"n_unverified":2,"n_pointer_only":0}},{"url":"/paper/udc-a-unified-neural-divide-and-conquer","title":"UDC: A Unified Neural Divide-and-Conquer Framework for Large-Scale Combinatorial Optimization Problems","date":"2024-06-29","arxiv_id":"2407.00312","repositories_listed":2,"syntology":null},{"url":"/paper/joint-admission-control-and-resource","title":"Joint Admission Control and Resource Allocation of Virtual Network Embedding via Hierarchical Deep Reinforcement Learning","date":"2024-06-25","arxiv_id":"2406.17334","repositories_listed":2,"syntology":{"n":7,"n_ran":3,"n_unverified":4,"n_pointer_only":7}},{"url":"/paper/distributional-miplib-a-multi-domain-library","title":"Distributional MIPLIB: a Multi-Domain Library for Advancing ML-Guided MILP Methods","date":"2024-06-11","arxiv_id":"2406.06954","repositories_listed":2,"syntology":{"n":6,"n_ran":5,"n_unverified":1,"n_pointer_only":0}},{"url":"/paper/tackling-prevalent-conditions-in-unsupervised","title":"Tackling Prevalent Conditions in Unsupervised Combinatorial Optimization: Cardinality, Minimum, Covering, and More","date":"2024-05-14","arxiv_id":"2405.08424","repositories_listed":2,"syntology":{"n":7,"n_ran":4,"n_unverified":3,"n_pointer_only":3}},{"url":"/paper/mvmoe-multi-task-vehicle-routing-solver-with","title":"MVMoE: Multi-Task Vehicle Routing Solver with Mixture-of-Experts","date":"2024-05-02","arxiv_id":"2405.01029","repositories_listed":2,"syntology":{"n":5,"n_ran":4,"n_unverified":1,"n_pointer_only":0}}],"syntology_records":23,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"}},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"}}