{"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/11","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":11,"pages_in_order":13,"rows_per_page":100,"rows":[1001,1100],"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/10","next":"/task/combinatorial-optimization/papers/12","papers":[{"url":null,"slug":"gumbel-softmax-based-optimization-a-simple","title":"Gumbel-softmax-based Optimization: A Simple General Framework for Optimization Problems on Graphs","date":"2020-04-14","arxiv_id":"2004.07300","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-general-large-neighborhood-search-framework","title":"A General Large Neighborhood Search Framework for Solving Integer Linear Programs","date":"2020-03-29","arxiv_id":"2004.00422","repositories_listed":0,"syntology":null},{"url":null,"slug":"diseno-e-implementacion-de-una-meta","title":"Diseño e implementación de una meta-heurística multi-poblacional de optimización combinatoria enfocada a la resolución de problemas de asignación de rutas a vehículos","date":"2020-03-24","arxiv_id":"2003.11393","repositories_listed":0,"syntology":null},{"url":null,"slug":"segmentation-and-optimal-region-selection-of","title":"Segmentation and Optimal Region Selection of Physiological Signals using Deep Neural Networks and Combinatorial Optimization","date":"2020-03-17","arxiv_id":"2003.07981","repositories_listed":0,"syntology":null},{"url":null,"slug":"real-world-airline-crew-pairing-optimization","title":"Real-World Airline Crew Pairing Optimization: Customized Genetic Algorithm versus Column Generation Method","date":"2020-03-08","arxiv_id":"2003.03792","repositories_listed":0,"syntology":null},{"url":null,"slug":"reinforcement-learning-for-combinatorial","title":"Reinforcement Learning for Combinatorial Optimization: A Survey","date":"2020-03-07","arxiv_id":"2003.03600","repositories_listed":0,"syntology":null},{"url":null,"slug":"ising-based-consensus-clustering-on","title":"Ising-based Consensus Clustering on Specialized Hardware","date":"2020-03-04","arxiv_id":"2003.01887","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-neural-networks-meet-neural-symbolic","title":"Graph Neural Networks Meet Neural-Symbolic Computing: A Survey and Perspective","date":"2020-02-29","arxiv_id":"2003.00330","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-effectiveness-of-johnson-lindenstrauss","title":"The Effectiveness of Johnson-Lindenstrauss Transform for High Dimensional Optimization With Adversarial Outliers, and the Recovery","date":"2020-02-27","arxiv_id":"2002.11923","repositories_listed":0,"syntology":null},{"url":null,"slug":"sparse-optimization-for-green-edge-ai","title":"Sparse Optimization for Green Edge AI Inference","date":"2020-02-24","arxiv_id":"2002.10080","repositories_listed":0,"syntology":null},{"url":null,"slug":"constrained-multiagent-rollout-and","title":"Constrained Multiagent Rollout and Multidimensional Assignment with the Auction Algorithm","date":"2020-02-18","arxiv_id":"2002.07407","repositories_listed":0,"syntology":null},{"url":null,"slug":"evolutionary-bi-objective-optimization-for","title":"Evolutionary Bi-objective Optimization for the Dynamic Chance-Constrained Knapsack Problem Based on Tail Bound Objectives","date":"2020-02-17","arxiv_id":"2002.06766","repositories_listed":0,"syntology":null},{"url":null,"slug":"accelerating-quantum-approximate-optimization","title":"Accelerating Quantum Approximate Optimization Algorithm using Machine Learning","date":"2020-02-04","arxiv_id":"2002.01089","repositories_listed":0,"syntology":null},{"url":null,"slug":"decoupling-learning-rates-using-empirical","title":"Bayesian Meta-Prior Learning Using Empirical Bayes","date":"2020-02-04","arxiv_id":"2002.01129","repositories_listed":0,"syntology":null},{"url":null,"slug":"wism-windowing-surrogate-model-for-evaluation","title":"WiSM: Windowing Surrogate Model for Evaluation of Curvature-Constrained Tours with Dubins vehicle","date":"2020-02-03","arxiv_id":"2002.00811","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-class-of-linear-programs-solvable-by","title":"A Class of Linear Programs Solvable by Coordinate-Wise Minimization","date":"2020-01-28","arxiv_id":"2001.10467","repositories_listed":0,"syntology":null},{"url":null,"slug":"discrete-graphical-models-an-optimization","title":"Discrete graphical models -- an optimization perspective","date":"2020-01-24","arxiv_id":"2001.09017","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-performance-of-metaheuristics-a","title":"On the Performance of Metaheuristics: A Different Perspective","date":"2020-01-24","arxiv_id":"2001.08928","repositories_listed":0,"syntology":null},{"url":null,"slug":"runtime-performances-of-randomized-search","title":"Runtime Performances of Randomized Search Heuristics for the Dynamic Weighted Vertex Cover Problem","date":"2020-01-24","arxiv_id":"2001.08903","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-ordering-towards-the-optimal-by","title":"Graph Ordering: Towards the Optimal by Learning","date":"2020-01-18","arxiv_id":"2001.06631","repositories_listed":0,"syntology":null},{"url":null,"slug":"parameterized-complexity-analysis-of","title":"Parameterized Complexity Analysis of Randomized Search Heuristics","date":"2020-01-15","arxiv_id":"2001.05120","repositories_listed":0,"syntology":null},{"url":null,"slug":"high-level-plan-for-behavioral-robot","title":"High-Level Plan for Behavioral Robot Navigation with Natural Language Directions and R-NET","date":"2020-01-08","arxiv_id":"2001.02330","repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-binary-data-by-application-of","title":"Clustering Binary Data by Application of Combinatorial Optimization Heuristics","date":"2020-01-06","arxiv_id":"2001.01809","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-fine-grained-search-space-pruning","title":"Learning fine-grained search space pruning and heuristics for combinatorial optimization","date":"2020-01-05","arxiv_id":"2001.01230","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-probability-density-theory-for-spin-glass","title":"A Probability Density Theory for Spin-Glass Systems","date":"2020-01-03","arxiv_id":"2001.00927","repositories_listed":0,"syntology":null},{"url":null,"slug":"estudo-comparativo-de-meta-heuristicas-para","title":"Estudo comparativo de meta-heurísticas para problemas de colorações de grafos","date":"2019-12-18","arxiv_id":"1912.11533","repositories_listed":0,"syntology":null},{"url":null,"slug":"provable-non-convex-optimization-and","title":"Provable Non-Convex Optimization and Algorithm Validation via Submodularity","date":"2019-12-18","arxiv_id":"1912.08495","repositories_listed":0,"syntology":null},{"url":null,"slug":"quantum-inspired-annealers-as-boltzmann","title":"Quantum-inspired annealers as Boltzmann generators for machine learning and statistical physics","date":"2019-12-18","arxiv_id":"1912.08480","repositories_listed":0,"syntology":null},{"url":null,"slug":"theory-of-neuromorphic-computing-by-waves","title":"Theory of neuromorphic computing by waves: machine learning by rogue waves, dispersive shocks, and solitons","date":"2019-12-15","arxiv_id":"1912.07044","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-dynamically-coordinate-multi","title":"Learning to Dynamically Coordinate Multi-Robot Teams in Graph Attention Networks","date":"2019-12-04","arxiv_id":"1912.02059","repositories_listed":0,"syntology":null},{"url":null,"slug":"improved-regret-bounds-for-bandit","title":"Improved Regret Bounds for Bandit Combinatorial Optimization","date":"2019-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"estimation-of-the-yield-curve-for-costa-rica","title":"Estimation of the yield curve for Costa Rica using combinatorial optimization metaheuristics applied to nonlinear regression","date":"2019-11-20","arxiv_id":"2001.00920","repositories_listed":0,"syntology":null},{"url":null,"slug":"novel-multi-objectivization-approaches-for","title":"Multi-objectivization Inspired Metaheuristics for the Sum-of-the-Parts Combinatorial Optimization Problems","date":"2019-11-12","arxiv_id":"1911.04658","repositories_listed":0,"syntology":null},{"url":null,"slug":"self-assignment-flows-for-unsupervised-data","title":"Self-Assignment Flows for Unsupervised Data Labeling on Graphs","date":"2019-11-08","arxiv_id":"1911.03472","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-order-graph-elements-with","title":"Learning to Order Graph Elements with Application to Multilingual Surface Realization","date":"2019-11-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-memetic-algorithm-based-on-breakout-local","title":"A Memetic Algorithm Based on Breakout Local Search for the Generalized Travelling Salesman Problem","date":"2019-10-19","arxiv_id":"1911.01966","repositories_listed":0,"syntology":null},{"url":null,"slug":"combinatorial-losses-through-generalized","title":"Differentiable Combinatorial Losses through Generalized Gradients of Linear Programs","date":"2019-10-18","arxiv_id":"1910.08211","repositories_listed":0,"syntology":null},{"url":null,"slug":"entity-summarization-state-of-the-art-and","title":"Entity Summarization: State of the Art and Future Challenges","date":"2019-10-18","arxiv_id":"1910.08252","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-chordal-extensions","title":"Learning chordal extensions","date":"2019-10-16","arxiv_id":"1910.07600","repositories_listed":0,"syntology":null},{"url":null,"slug":"generative-neural-network-based-spectrum","title":"Generative Neural Network based Spectrum Sharing using Linear Sum Assignment Problems","date":"2019-10-12","arxiv_id":"1910.05510","repositories_listed":0,"syntology":null},{"url":null,"slug":"context-aware-online-adaptation-of-mixed","title":"Context-Aware Online Adaptation of Mixed Reality Interfaces","date":"2019-10-10","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"kernels-over-sets-of-finite-sets-using-rkhs","title":"Kernels over Sets of Finite Sets using RKHS Embeddings, with Application to Bayesian (Combinatorial) Optimization","date":"2019-10-09","arxiv_id":"1910.04086","repositories_listed":0,"syntology":null},{"url":null,"slug":"faster-width-dependent-algorithm-for-mixed","title":"Faster width-dependent algorithm for mixed packing and covering LPs","date":"2019-09-26","arxiv_id":"1909.12387","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-auto-deferring-policy-for-combinatorial","title":"Deep Auto-Deferring Policy for Combinatorial Optimization","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"deepsimplex-reinforcement-learning-of-pivot","title":"DeepSimplex: Reinforcement Learning of Pivot Rules Improves the Efficiency of Simplex Algorithm in Solving Linear Programming Problems","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"solving-packing-problems-by-conditional-query","title":"Solving Packing Problems by Conditional Query Learning","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"yaogan-learning-worst-case-competitive","title":"YaoGAN: Learning Worst-case Competitive Algorithms from Self-generated Inputs","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"190910427","title":"A Time-Dependent TSP Formulation for the Design of an Active Debris Removal Mission using Simulated Annealing","date":"2019-09-23","arxiv_id":"1909.10427","repositories_listed":0,"syntology":null},{"url":null,"slug":"gumbel-softmax-optimization-a-simple-general","title":"Gumbel-softmax Optimization: A Simple General Framework for Combinatorial Optimization Problems on Graphs","date":"2019-09-16","arxiv_id":"1909.07018","repositories_listed":0,"syntology":null},{"url":null,"slug":"aed-an-anytime-evolutionary-dcop-algorithm","title":"AED: An Anytime Evolutionary DCOP Algorithm","date":"2019-09-13","arxiv_id":"1909.06254","repositories_listed":0,"syntology":null},{"url":null,"slug":"combining-learned-representations-for-1","title":"Combining Learned Representations for Combinatorial Optimization","date":"2019-09-09","arxiv_id":"1909.03978","repositories_listed":0,"syntology":null},{"url":null,"slug":"story-oriented-image-selection-and-placement","title":"Story-oriented Image Selection and Placement","date":"2019-09-02","arxiv_id":"1909.00692","repositories_listed":0,"syntology":null},{"url":null,"slug":"charged-particle-tracking-with-quantum","title":"Charged particle tracking with quantum annealing-inspired optimization","date":"2019-08-13","arxiv_id":"1908.04475","repositories_listed":0,"syntology":null},{"url":null,"slug":"combinatorial-keyword-recommendations-for","title":"Combinatorial Keyword Recommendations for Sponsored Search with Deep Reinforcement Learning","date":"2019-07-18","arxiv_id":"1907.08686","repositories_listed":0,"syntology":null},{"url":null,"slug":"deepda-lstm-based-deep-data-association","title":"DeepDA: LSTM-based Deep Data Association Network for Multi-Targets Tracking in Clutter","date":"2019-07-16","arxiv_id":"1907.09915","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-handle-parameter-perturbations-in","title":"Learning to Handle Parameter Perturbations in Combinatorial Optimization: an Application to Facility Location","date":"2019-07-12","arxiv_id":"1907.05765","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-learning-for-min-max-discrete-problems","title":"Online learning for min-max discrete problems","date":"2019-07-12","arxiv_id":"1907.05944","repositories_listed":0,"syntology":null},{"url":null,"slug":"highly-parallel-algorithm-for-the-ising","title":"Highly parallel algorithm for the Ising ground state searching problem","date":"2019-07-11","arxiv_id":"1907.05124","repositories_listed":0,"syntology":null},{"url":null,"slug":"reinforcement-learning-with-chromatic","title":"Reinforcement Learning with Chromatic Networks for Compact Architecture Search","date":"2019-07-10","arxiv_id":"1907.06511","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-new-hybrid-genetic-algorithm-for-protein","title":"A new hybrid genetic algorithm for protein structure prediction on the 2D triangular lattice","date":"2019-07-08","arxiv_id":"1907.04190","repositories_listed":0,"syntology":null},{"url":null,"slug":"thompson-sampling-for-combinatorial-network","title":"Thompson Sampling for Combinatorial Network Optimization in Unknown Environments","date":"2019-07-07","arxiv_id":"1907.04201","repositories_listed":0,"syntology":null},{"url":null,"slug":"approximate-sherali-adams-relaxations-for-map","title":"Convergence Rates of Smooth Message Passing with Rounding in Entropy-Regularized MAP Inference","date":"2019-07-02","arxiv_id":"1907.01127","repositories_listed":0,"syntology":null},{"url":null,"slug":"forecasting-high-dimensional-dynamics","title":"Forecasting high-dimensional dynamics exploiting suboptimal embeddings","date":"2019-07-02","arxiv_id":"1907.01552","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-solution-predictions-for-mixed","title":"Accelerating Primal Solution Findings for Mixed Integer Programs Based on Solution Prediction","date":"2019-06-23","arxiv_id":"1906.09575","repositories_listed":0,"syntology":null},{"url":null,"slug":"reinforcement-learning-driven-heuristic","title":"Reinforcement Learning Driven Heuristic Optimization","date":"2019-06-16","arxiv_id":"1906.06639","repositories_listed":0,"syntology":null},{"url":null,"slug":"combining-reinforcement-learning-and","title":"Combining Reinforcement Learning and Configuration Checking for Maximum k-plex Problem","date":"2019-06-06","arxiv_id":"1906.02578","repositories_listed":0,"syntology":null},{"url":null,"slug":"resolving-overlapping-convex-objects-in","title":"Resolving Overlapping Convex Objects in Silhouette Images by Concavity Analysis and Gaussian Process","date":"2019-06-03","arxiv_id":"1906.01049","repositories_listed":0,"syntology":null},{"url":null,"slug":"combinatorial-persistency-criteria-for","title":"Combinatorial Persistency Criteria for Multicut and Max-Cut","date":"2019-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"two-dimensional-phase-unwrapping-via-balanced","title":"Two-Dimensional Phase Unwrapping via Balanced Spanning Forests","date":"2019-05-30","arxiv_id":"1812.08277","repositories_listed":0,"syntology":null},{"url":null,"slug":"scalable-and-transferable-learning-of","title":"Learning NP-Hard Multi-Agent Assignment Planning using GNN: Inference on a Random Graph and Provable Auction-Fitted Q-learning","date":"2019-05-29","arxiv_id":"1905.12204","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-goal-recognition-with-operator","title":"An LP-Based Approach for Goal Recognition as Planning","date":"2019-05-10","arxiv_id":"1905.04210","repositories_listed":0,"syntology":null},{"url":null,"slug":"design-space-exploration-as-quantified","title":"Design Space Exploration as Quantified Satisfaction","date":"2019-05-07","arxiv_id":"1905.02303","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-new-dog-learns-old-tricks-rl-finds-classic","title":"A new dog learns old tricks: RL finds classic optimization algorithms","date":"2019-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-solve-circuit-sat-an-unsupervised","title":"Learning To Solve Circuit-SAT: An Unsupervised Differentiable Approach","date":"2019-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"the-cakewalk-method","title":"The Cakewalk Method","date":"2019-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"training-hard-threshold-networks-with","title":"Training Hard-Threshold Networks with Combinatorial Search in a Discrete Target Propagation Setting","date":"2019-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"structural-self-adaptation-for-decentralized","title":"Structural Self-adaptation for Decentralized Pervasive Intelligence","date":"2019-04-21","arxiv_id":"1904.09681","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-upper-bound-for-minimum-true-matches-in","title":"An Upper Bound for Minimum True Matches in Graph Isomorphism with Simulated Annealing","date":"2019-03-29","arxiv_id":"1903.12527","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploiting-promising-sub-sequences-of-jobs-to","title":"Exploiting Promising Sub-Sequences of Jobs to solve the No-Wait Flowshop Scheduling Problem","date":"2019-03-21","arxiv_id":"1903.09035","repositories_listed":0,"syntology":null},{"url":null,"slug":"iterated-two-phase-local-search-for-the-set","title":"Iterated two-phase local search for the Set-Union Knapsack Problem","date":"2019-03-12","arxiv_id":"1903.04966","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-self-game-play-agents-for","title":"Learning Self-Game-Play Agents for Combinatorial Optimization Problems","date":"2019-03-08","arxiv_id":"1903.03674","repositories_listed":0,"syntology":null},{"url":null,"slug":"end-to-end-efficient-representation-learning","title":"End-to-End Efficient Representation Learning via Cascading Combinatorial Optimization","date":"2019-02-28","arxiv_id":"1902.10990","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-and-fast-real-time-resources-slicing","title":"Optimal and Fast Real-time Resources Slicing with Deep Dueling Neural Networks","date":"2019-02-26","arxiv_id":"1902.09696","repositories_listed":0,"syntology":null},{"url":null,"slug":"first-order-regret-analysis-of-thompson","title":"First-Order Bayesian Regret Analysis of Thompson Sampling","date":"2019-02-02","arxiv_id":"1902.00681","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploiting-problem-structure-in-combinatorial","title":"Exploiting Problem Structure in Combinatorial Landscapes: A Case Study on Pure Mathematics Application","date":"2018-12-22","arxiv_id":"1812.09421","repositories_listed":0,"syntology":null},{"url":null,"slug":"algorithms-inspired-by-nature-a-survey","title":"Algorithms Inspired by Nature: A Survey","date":"2018-12-13","arxiv_id":"1903.01893","repositories_listed":0,"syntology":null},{"url":null,"slug":"mixed-uncertainty-sets-for-robust","title":"Mixed Uncertainty Sets for Robust Combinatorial Optimization","date":"2018-12-12","arxiv_id":"1812.04895","repositories_listed":0,"syntology":null},{"url":null,"slug":"machine-learning-for-combinatorial","title":"Machine Learning for Combinatorial Optimization: a Methodological Tour d'Horizon","date":"2018-11-15","arxiv_id":"1811.06128","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-assortment-optimization-with-changing","title":"Dynamic Assortment Optimization with Changing Contextual Information","date":"2018-10-31","arxiv_id":"1810.13069","repositories_listed":0,"syntology":null},{"url":null,"slug":"differentiable-greedy-networks","title":"Differentiable Greedy Networks","date":"2018-10-30","arxiv_id":"1810.12464","repositories_listed":0,"syntology":null},{"url":null,"slug":"ms-baco-a-new-model-selection-algorithm-using","title":"MS-BACO: A new Model Selection algorithm using Binary Ant Colony Optimization for neural complexity and error reduction","date":"2018-10-21","arxiv_id":"1810.08944","repositories_listed":0,"syntology":null},{"url":null,"slug":"melding-the-data-decisions-pipeline-decision","title":"Melding the Data-Decisions Pipeline: Decision-Focused Learning for Combinatorial Optimization","date":"2018-09-14","arxiv_id":"1809.05504","repositories_listed":0,"syntology":null},{"url":null,"slug":"mrf-optimization-with-separable-convex-prior","title":"MRF Optimization with Separable Convex Prior on Partially Ordered Labels","date":"2018-09-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"algoritmos-geneticos-aplicado-ao-problema-de","title":"Algoritmos Genéticos Aplicado ao Problema de Roteamento de Veículos","date":"2018-08-31","arxiv_id":"1808.10866","repositories_listed":0,"syntology":null},{"url":null,"slug":"parallelization-does-not-accelerate-convex","title":"Parallelization does not Accelerate Convex Optimization: Adaptivity Lower Bounds for Non-smooth Convex Minimization","date":"2018-08-12","arxiv_id":"1808.03880","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-iterative-path-breaking-approach-with","title":"An Iterative Path-Breaking Approach with Mutation and Restart Strategies for the MAX-SAT Problem","date":"2018-08-10","arxiv_id":"1808.03611","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-fully-automated-protein-structure","title":"Towards fully automated protein structure elucidation with NMR spectroscopy","date":"2018-07-31","arxiv_id":"1808.00564","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-approximation-algorithm-for-risk-averse","title":"An Approximation Algorithm for Risk-averse Submodular Optimization","date":"2018-07-24","arxiv_id":"1807.09358","repositories_listed":0,"syntology":null},{"url":null,"slug":"boosting-combinatorial-problem-modeling-with","title":"Boosting Combinatorial Problem Modeling with Machine Learning","date":"2018-07-15","arxiv_id":"1807.05517","repositories_listed":0,"syntology":null},{"url":null,"slug":"automatic-rank-selection-for-high-speed","title":"Automatic Rank Selection for High-Speed Convolutional Neural Network","date":"2018-06-28","arxiv_id":"1806.10821","repositories_listed":0,"syntology":null}],"record_sha256":"3a944398cc0ae2d9fa982b98994b19b14e3748551c495f5b6514c9a462a1a0c7","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}