{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/combinatorial-optimization/papers/13","list_of":"/task/combinatorial-optimization","task":"Combinatorial Optimization","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":13,"pages_in_order":13,"rows_per_page":100,"rows":[1201,1277],"of":1277,"counts":{"archive_papers_tagged":1277,"with_a_code_link":401,"where_syntology_ran_a_sample":122,"not_listed_spam_title":0,"listed":1277,"listed_where_code_ran":122,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":105,"every_run_a_failure_of_syntologys_instrument":17,"listed_with_a_run_with_no_instrument_failure":105,"listed_every_run_a_failure_of_syntologys_instrument":17,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/combinatorial-optimization","prev":"/task/combinatorial-optimization/papers/12","next":null,"papers":[{"url":null,"slug":"inference-of-hidden-structures-in-complex","title":"Inference of hidden structures in complex physical systems by multi-scale clustering","date":"2015-03-05","arxiv_id":"1503.01626","repositories_listed":0,"syntology":null},{"url":null,"slug":"faster-quantum-mixing-for-slowly-evolving","title":"Faster quantum mixing for slowly evolving sequences of Markov chains","date":"2015-03-04","arxiv_id":"1503.01334","repositories_listed":0,"syntology":null},{"url":null,"slug":"first-order-regret-bounds-for-combinatorial","title":"First-order regret bounds for combinatorial semi-bandits","date":"2015-02-23","arxiv_id":"1502.06354","repositories_listed":0,"syntology":null},{"url":null,"slug":"cheaper-and-better-selecting-good-workers-for","title":"Cheaper and Better: Selecting Good Workers for Crowdsourcing","date":"2015-02-03","arxiv_id":"1502.00725","repositories_listed":0,"syntology":null},{"url":null,"slug":"chemical-reaction-optimization-for-the-set","title":"Chemical Reaction Optimization for the Set Covering Problem","date":"2015-02-01","arxiv_id":"1502.00199","repositories_listed":0,"syntology":null},{"url":null,"slug":"fragmentation-trees-reloaded","title":"Fragmentation trees reloaded","date":"2015-01-28","arxiv_id":"1412.1929","repositories_listed":0,"syntology":null},{"url":null,"slug":"max-product-belief-propagation-for-linear","title":"Max-Product Belief Propagation for Linear Programming: Applications to Combinatorial Optimization","date":"2014-12-16","arxiv_id":"1412.4972","repositories_listed":0,"syntology":null},{"url":null,"slug":"computational-protein-design-using-andor","title":"Computational Protein Design Using AND/OR Branch-and-Bound Search","date":"2014-12-08","arxiv_id":"1412.3138","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-string-kernel-pre-image-problem-with","title":"On the String Kernel Pre-Image Problem with Applications in Drug Discovery","date":"2014-12-03","arxiv_id":"1412.1463","repositories_listed":0,"syntology":null},{"url":null,"slug":"chases-and-escapes-and-optimization-problems","title":"Chases and Escapes, and Optimization Problems","date":"2014-12-01","arxiv_id":"1412.2114","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-learning-by-implicit-exploration-in","title":"Efficient learning by implicit exploration in bandit problems with side observations","date":"2014-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-search-in-branch-and-bound","title":"Learning to Search in Branch and Bound Algorithms","date":"2014-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"online-combinatorial-optimization-with","title":"Online combinatorial optimization with stochastic decision sets and adversarial losses","date":"2014-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"topic-based-multi-document-summarization","title":"Topic-based Multi-document Summarization using Differential Evolution forCombinatorial Optimization of Sentences","date":"2014-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"scalability-of-using-restricted-boltzmann","title":"Scalability of using Restricted Boltzmann Machines for Combinatorial Optimization","date":"2014-11-27","arxiv_id":"1411.7542","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-weighted-common-subgraph-matching-algorithm","title":"A Weighted Common Subgraph Matching Algorithm","date":"2014-11-04","arxiv_id":"1411.0763","repositories_listed":0,"syntology":null},{"url":null,"slug":"local-optimal-sets-and-bounded-archiving-on","title":"Local Optimal Sets and Bounded Archiving on Multi-objective NK-Landscapes with Correlated Objectives","date":"2014-09-19","arxiv_id":"1409.5719","repositories_listed":0,"syntology":null},{"url":null,"slug":"real-time-crowd-tracking-using-parameter","title":"Real-time Crowd Tracking using Parameter Optimized Mixture of Motion Models","date":"2014-09-16","arxiv_id":"1409.4481","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-decision-support-technology-platform","title":"Towards Decision Support Technology Platform for Modular Systems","date":"2014-08-23","arxiv_id":"1408.5492","repositories_listed":0,"syntology":null},{"url":null,"slug":"cortical-processing-with-thermodynamic-ram","title":"Cortical Processing with Thermodynamic-RAM","date":"2014-08-14","arxiv_id":"1408.3215","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-generate-coherent-summary-with","title":"Learning to Generate Coherent Summary with Discriminative Hidden Semi-Markov Model","date":"2014-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"quadratically-constrained-quadratic","title":"Quadratically constrained quadratic programming for classification using particle swarms and applications","date":"2014-07-23","arxiv_id":"1407.6315","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-comparative-study-of-meta-heuristic","title":"A Comparative Study of Meta-heuristic Algorithms for Solving Quadratic Assignment Problem","date":"2014-07-18","arxiv_id":"1407.4863","repositories_listed":0,"syntology":null},{"url":null,"slug":"higher-order-quantum-inspired-genetic","title":"Higher-Order Quantum-Inspired Genetic Algorithms","date":"2014-07-02","arxiv_id":"1407.0977","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-interacting-replica-approach-applied-to","title":"An interacting replica approach applied to the traveling salesman problem","date":"2014-06-27","arxiv_id":"1406.7282","repositories_listed":0,"syntology":null},{"url":null,"slug":"single-document-summarization-based-on-nested","title":"Single Document Summarization based on Nested Tree Structure","date":"2014-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"mathematical-programming-strategies-for","title":"Mathematical Programming Strategies for Solving the Minimum Common String Partition Problem","date":"2014-05-22","arxiv_id":"1405.5646","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-genetic-algorithm-for-solving-quadratic","title":"A Genetic Algorithm for solving Quadratic Assignment Problem(QAP)","date":"2014-05-20","arxiv_id":"1405.5050","repositories_listed":0,"syntology":null},{"url":null,"slug":"d-bees-a-novel-method-inspired-by-bee-colony","title":"D-Bees: A Novel Method Inspired by Bee Colony Optimization for Solving Word Sense Disambiguation","date":"2014-05-06","arxiv_id":"1405.1406","repositories_listed":0,"syntology":null},{"url":null,"slug":"matroid-bandits-fast-combinatorial","title":"Matroid Bandits: Fast Combinatorial Optimization with Learning","date":"2014-03-20","arxiv_id":"1403.5045","repositories_listed":0,"syntology":null},{"url":null,"slug":"numvc-an-efficient-local-search-algorithm-for","title":"NuMVC: An Efficient Local Search Algorithm for Minimum Vertex Cover","date":"2014-02-04","arxiv_id":"1402.0584","repositories_listed":0,"syntology":null},{"url":null,"slug":"principled-graph-matching-algorithms-for","title":"Principled Graph Matching Algorithms for Integrating Multiple Data Sources","date":"2014-02-03","arxiv_id":"1402.0282","repositories_listed":0,"syntology":null},{"url":null,"slug":"effective-features-of-remote-sensing-image","title":"Effective Features of Remote Sensing Image Classification Using Interactive Adaptive Thresholding Method","date":"2014-01-30","arxiv_id":"1401.7743","repositories_listed":0,"syntology":null},{"url":null,"slug":"parallel-genetic-algorithm-to-solve-traveling","title":"Parallel Genetic Algorithm to Solve Traveling Salesman Problem on MapReduce Framework using Hadoop Cluster","date":"2014-01-24","arxiv_id":"1401.6267","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-tutorial-on-dual-decomposition-and","title":"A Tutorial on Dual Decomposition and Lagrangian Relaxation for Inference in Natural Language Processing","date":"2014-01-23","arxiv_id":"1405.5208","repositories_listed":0,"syntology":null},{"url":null,"slug":"solving-the-minimum-common-string-partition","title":"Solving the Minimum Common String Partition Problem with the Help of Ants","date":"2014-01-18","arxiv_id":"1401.4539","repositories_listed":0,"syntology":null},{"url":null,"slug":"budgeted-influence-maximization-for-multiple","title":"Budgeted Influence Maximization for Multiple Products","date":"2013-12-08","arxiv_id":"1312.2164","repositories_listed":0,"syntology":null},{"url":null,"slug":"embed-and-project-discrete-sampling-with","title":"Embed and Project: Discrete Sampling with Universal Hashing","date":"2013-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"statistical-estimation-for-optimization","title":"Statistical estimation for optimization problems on graphs","date":"2013-11-29","arxiv_id":"1311.7656","repositories_listed":0,"syntology":null},{"url":null,"slug":"rough-matroids-based-on-coverings","title":"Rough matroids based on coverings","date":"2013-11-02","arxiv_id":"1311.0351","repositories_listed":0,"syntology":null},{"url":null,"slug":"green-heron-swarm-optimization-algorithm","title":"Green Heron Swarm Optimization Algorithm - State-of-the-Art of a New Nature Inspired Discrete Meta-Heuristics","date":"2013-10-14","arxiv_id":"1310.3805","repositories_listed":0,"syntology":null},{"url":null,"slug":"potts-model-parametric-maxflow-and-k","title":"Potts model, parametric maxflow and k-submodular functions","date":"2013-10-07","arxiv_id":"1310.1771","repositories_listed":0,"syntology":null},{"url":null,"slug":"iterated-variable-neighborhood-search-for-the","title":"Iterated Variable Neighborhood Search for the resource constrained multi-mode multi-project scheduling problem","date":"2013-10-02","arxiv_id":"1310.0602","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-feature-selection-for-dependency","title":"Dynamic Feature Selection for Dependency Parsing","date":"2013-10-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"single-document-summarization-as-a-tree","title":"Single-Document Summarization as a Tree Knapsack Problem","date":"2013-10-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-meta-heuristically-approach-of-the-spatial","title":"A Meta-heuristically Approach of the Spatial Assignment Problem of Human Resources in Multi-sites Enterprise","date":"2013-09-22","arxiv_id":"1310.8588","repositories_listed":0,"syntology":null},{"url":null,"slug":"scalable-anomaly-detection-in-large","title":"Scalable Anomaly Detection in Large Homogenous Populations","date":"2013-09-20","arxiv_id":"1309.5803","repositories_listed":0,"syntology":null},{"url":null,"slug":"gncgcp-graduated-nonconvexity-and-graduated","title":"GNCGCP - Graduated NonConvexity and Graduated Concavity Procedure","date":"2013-08-29","arxiv_id":"1308.6388","repositories_listed":0,"syntology":null},{"url":null,"slug":"density-maximization-in-context-sense-metric","title":"Density Maximization in Context-Sense Metric Space for All-words WSD","date":"2013-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-dynamic-algorithm-for-the-longest-common","title":"A Dynamic Algorithm for the Longest Common Subsequence Problem using Ant Colony Optimization Technique","date":"2013-07-07","arxiv_id":"1307.1905","repositories_listed":0,"syntology":null},{"url":null,"slug":"fuzzy-integer-linear-programming-mathematical","title":"Fuzzy Integer Linear Programming Mathematical Models for Examination Timetable Problem","date":"2013-07-07","arxiv_id":"1307.1900","repositories_listed":0,"syntology":null},{"url":null,"slug":"submodularity-of-a-set-label-disagreement","title":"Submodularity of a Set Label Disagreement Function","date":"2013-07-02","arxiv_id":"1307.1303","repositories_listed":0,"syntology":null},{"url":null,"slug":"second-order-swarm-intelligence","title":"Second Order Swarm Intelligence","date":"2013-06-13","arxiv_id":"1306.3018","repositories_listed":0,"syntology":null},{"url":null,"slug":"iterated-tabu-search-algorithm-for-packing","title":"Iterated Tabu Search Algorithm for Packing Unequal Circles in a Circle","date":"2013-06-04","arxiv_id":"1306.0694","repositories_listed":0,"syntology":null},{"url":null,"slug":"evolutionary-approach-for-the-containers-bin","title":"Evolutionary Approach for the Containers Bin-Packing Problem","date":"2013-06-03","arxiv_id":"1306.0442","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-3d-endfiring-trus-prostate","title":"Efficient 3D Endfiring TRUS Prostate Segmentation with Globally Optimized Rotational Symmetry","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-efficient-and-exact-map-inference-for","title":"Towards Efficient and Exact MAP-Inference for Large Scale Discrete Computer Vision Problems via Combinatorial Optimization","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"an-efficient-algorithm-for-learning-with-semi","title":"An efficient algorithm for learning with semi-bandit feedback","date":"2013-05-13","arxiv_id":"1305.2732","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-discrete-state-transition-algorithm-for","title":"A Discrete State Transition Algorithm for Generalized Traveling Salesman Problem","date":"2013-04-29","arxiv_id":"1304.7607","repositories_listed":0,"syntology":null},{"url":null,"slug":"improvementextension-of-modular-systems-as","title":"Improvement/Extension of Modular Systems as Combinatorial Reengineering (Survey)","date":"2013-04-17","arxiv_id":"1304.4965","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-improved-acs-algorithm-for-the-solutions","title":"An Improved ACS Algorithm for the Solutions of Larger TSP Problems","date":"2013-04-13","arxiv_id":"1304.3763","repositories_listed":0,"syntology":null},{"url":null,"slug":"note-on-combinatorial-engineering-frameworks","title":"Note on Combinatorial Engineering Frameworks for Hierarchical Modular Systems","date":"2013-03-29","arxiv_id":"1304.0030","repositories_listed":0,"syntology":null},{"url":null,"slug":"detecting-overlapping-temporal-community","title":"Detecting Overlapping Temporal Community Structure in Time-Evolving Networks","date":"2013-03-28","arxiv_id":"1303.7226","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-lovasz-function-svms-and-finding-large","title":"The Lovász ϑ function, SVMs and finding large dense subgraphs","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-unifying-survey-of-reinforced-sensitive-and","title":"A Unifying Survey of Reinforced, Sensitive and Stigmergic Agent-Based Approaches for E-GTSP","date":"2012-08-24","arxiv_id":"1208.4942","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-amortizing-inference-cost-for-structured","title":"On Amortizing Inference Cost for Structured Prediction","date":"2012-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"batch-active-learning-via-coordinated","title":"Batch Active Learning via Coordinated Matching","date":"2012-06-27","arxiv_id":"1206.6458","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-comparison-of-greedy-and-optimal-assessment","title":"A Comparison of Greedy and Optimal Assessment of Natural Language Student Input Using Word-to-Word Similarity Metrics","date":"2012-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"implicitly-intersecting-weighted-automata","title":"Implicitly Intersecting Weighted Automata using Dual Decomposition","date":"2012-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"optimized-online-rank-learning-for-machine","title":"Optimized Online Rank Learning for Machine Translation","date":"2012-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"12033461","title":"Robust Metric Learning by Smooth Optimization","date":"2012-03-15","arxiv_id":"1203.3461","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-polynomial-time-approximation-scheme-for-a","title":"A Polynomial Time Approximation Scheme for a Single Machine Scheduling Problem Using a Hybrid Evolutionary Algorithm","date":"2012-02-08","arxiv_id":"1202.1708","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-with-submodular-functions-a-convex","title":"Learning with Submodular Functions: A Convex Optimization Perspective","date":"2011-11-28","arxiv_id":"1111.6453","repositories_listed":0,"syntology":null},{"url":null,"slug":"ant-colony-optimization-and-hypergraph","title":"Ant Colony Optimization and Hypergraph Covering Problems","date":"2011-05-14","arxiv_id":"1105.2894","repositories_listed":0,"syntology":null},{"url":null,"slug":"active-instance-sampling-via-matrix-partition","title":"Active Instance Sampling via Matrix Partition","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"combinatorial-network-optimization-with","title":"Combinatorial Network Optimization with Unknown Variables: Multi-Armed Bandits with Linear Rewards","date":"2010-11-22","arxiv_id":"1011.4748","repositories_listed":0,"syntology":null},{"url":null,"slug":"diffrac-a-discriminative-and-flexible","title":"DIFFRAC: a discriminative and flexible framework for clustering","date":"2007-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null}],"record_sha256":"f316aefb4a51592eac85b6dae6a14e07c496ff93943b17fdb0af2f34cd59fe4c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}