{"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/6","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":6,"pages_in_order":13,"rows_per_page":100,"rows":[501,600],"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/5","next":"/task/combinatorial-optimization/papers/7","papers":[{"url":null,"slug":"investigating-layer-selective-transfer","title":"Investigating layer-selective transfer learning of QAOA parameters for Max-Cut problem","date":"2024-12-30","arxiv_id":"2412.21071","repositories_listed":0,"syntology":null},{"url":null,"slug":"scalable-quantum-inspired-optimization","title":"Scalable Quantum-Inspired Optimization through Dynamic Qubit Compression","date":"2024-12-24","arxiv_id":"2412.18571","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-enhancing-network-throughput-using","title":"On Enhancing Network Throughput using Reinforcement Learning in Sliced Testbeds","date":"2024-12-21","arxiv_id":"2412.16673","repositories_listed":0,"syntology":null},{"url":null,"slug":"concept-learning-in-the-wild-towards","title":"Concept Learning in the Wild: Towards Algorithmic Understanding of Neural Networks","date":"2024-12-15","arxiv_id":"2412.11205","repositories_listed":0,"syntology":null},{"url":null,"slug":"brain-inspired-chaotic-graph-backpropagation","title":"Brain-inspired Chaotic Graph Backpropagation for Large-scale Combinatorial Optimization","date":"2024-12-13","arxiv_id":"2412.09860","repositories_listed":0,"syntology":null},{"url":null,"slug":"scaling-combinatorial-optimization-neural","title":"Scaling Combinatorial Optimization Neural Improvement Heuristics with Online Search and Adaptation","date":"2024-12-13","arxiv_id":"2412.10163","repositories_listed":0,"syntology":null},{"url":null,"slug":"sizegs-size-aware-compression-of-3d-gaussians","title":"SizeGS: Size-aware Compression of 3D Gaussians with Hierarchical Mixed Precision Quantization","date":"2024-12-08","arxiv_id":"2412.05808","repositories_listed":0,"syntology":null},{"url":null,"slug":"xkv-personalized-kv-cache-memory-reduction","title":"XKV: Personalized KV Cache Memory Reduction for Long-Context LLM Inference","date":"2024-12-08","arxiv_id":"2412.05896","repositories_listed":0,"syntology":null},{"url":null,"slug":"liar-leveraging-alignment-best-of-n-to","title":"LIAR: Leveraging Alignment (Best-of-N) to Jailbreak LLMs in Seconds","date":"2024-12-06","arxiv_id":"2412.05232","repositories_listed":0,"syntology":null},{"url":null,"slug":"cada-cross-problem-routing-solver-with","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","date":"2024-11-30","arxiv_id":"2412.00346","repositories_listed":0,"syntology":null},{"url":null,"slug":"scalable-iterative-pruning-of-large-language","title":"Scalable iterative pruning of large language and vision models using block coordinate descent","date":"2024-11-26","arxiv_id":"2411.17796","repositories_listed":0,"syntology":null},{"url":null,"slug":"large-language-models-for-combinatorial","title":"Large Language Models for Combinatorial Optimization of Design Structure Matrix","date":"2024-11-19","arxiv_id":"2411.12571","repositories_listed":0,"syntology":null},{"url":null,"slug":"design-and-optimization-of-multi-rendezvous","title":"Design And Optimization Of Multi-rendezvous Manoeuvres Based On Reinforcement Learning And Convex Optimization","date":"2024-11-18","arxiv_id":"2411.11778","repositories_listed":0,"syntology":null},{"url":null,"slug":"liner-shipping-network-design-with","title":"Liner Shipping Network Design with Reinforcement Learning","date":"2024-11-13","arxiv_id":"2411.09068","repositories_listed":0,"syntology":null},{"url":null,"slug":"mbl-cpdp-a-multi-objective-bilevel-method-for","title":"MBL-CPDP: A Multi-objective Bilevel Method for Cross-Project Defect Prediction via Automated Machine Learning","date":"2024-11-10","arxiv_id":"2411.06491","repositories_listed":0,"syntology":null},{"url":null,"slug":"neuro-symbolic-rule-lists","title":"Neuro-Symbolic Rule Lists","date":"2024-11-10","arxiv_id":"2411.06428","repositories_listed":0,"syntology":null},{"url":null,"slug":"learn-to-solve-vehicle-routing-problems-asap","title":"Learn to Solve Vehicle Routing Problems ASAP: A Neural Optimization Approach for Time-Constrained Vehicle Routing Problems with Finite Vehicle Fleet","date":"2024-11-07","arxiv_id":"2411.04777","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-random-key-optimizer-for-combinatorial","title":"A Random-Key Optimizer for Combinatorial Optimization","date":"2024-11-06","arxiv_id":"2411.04293","repositories_listed":0,"syntology":null},{"url":null,"slug":"assessing-and-enhancing-graph-neural-networks","title":"Assessing and Enhancing Graph Neural Networks for Combinatorial Optimization: Novel Approaches and Application in Maximum Independent Set Problems","date":"2024-11-06","arxiv_id":"2411.05834","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-networks-and-virtual-extended","title":"Neural Networks and (Virtual) Extended Formulations","date":"2024-11-05","arxiv_id":"2411.03006","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-memetic-models-for-combinatorial","title":"Deep memetic models for combinatorial optimization problems: application to the tool switching problem","date":"2024-11-04","arxiv_id":"2411.01922","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-geometry-preserving-reductions","title":"Towards Geometry-Preserving Reductions Between Constraint Satisfaction Problems (and other problems in NP)","date":"2024-10-31","arxiv_id":"2411.10453","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-irs-enhanced-wireless-coverage","title":"Multi-IRS Enhanced Wireless Coverage: Deployment Optimization Based on Large-Scale Channel Knowledge","date":"2024-10-26","arxiv_id":"2410.20042","repositories_listed":0,"syntology":null},{"url":null,"slug":"theoretically-grounded-pruning-of-large","title":"Theoretically Grounded Pruning of Large Ground Sets for Constrained, Discrete Optimization","date":"2024-10-23","arxiv_id":"2410.17945","repositories_listed":0,"syntology":null},{"url":null,"slug":"permutation-picture-of-graph-combinatorial","title":"Permutation Picture of Graph Combinatorial Optimization Problems","date":"2024-10-22","arxiv_id":"2410.17111","repositories_listed":0,"syntology":null},{"url":null,"slug":"offline-reinforcement-learning-for-job-shop","title":"Offline reinforcement learning for job-shop scheduling problems","date":"2024-10-21","arxiv_id":"2410.15714","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhancing-in-vehicle-multiple-object-tracking","title":"Enhancing In-vehicle Multiple Object Tracking Systems with Embeddable Ising Machines","date":"2024-10-18","arxiv_id":"2410.14093","repositories_listed":0,"syntology":null},{"url":null,"slug":"selection-of-filters-for-photonic-crystal","title":"Selection of Filters for Photonic Crystal Spectrometer Using Domain-Aware Evolutionary Algorithms","date":"2024-10-17","arxiv_id":"2410.13657","repositories_listed":0,"syntology":null},{"url":null,"slug":"initialization-method-for-factorization","title":"Initialization Method for Factorization Machine Based on Low-Rank Approximation for Constructing a Corrected Approximate Ising Model","date":"2024-10-16","arxiv_id":"2410.12747","repositories_listed":0,"syntology":null},{"url":null,"slug":"ic-dc-surpassing-heuristic-solvers-in","title":"Unsupervised Training of Diffusion Models for Feasible Solution Generation in Neural Combinatorial Optimization","date":"2024-10-15","arxiv_id":"2411.00003","repositories_listed":0,"syntology":null},{"url":null,"slug":"d-wave-s-nonlinear-program-hybrid-solver","title":"D-Wave's Nonlinear-Program Hybrid Solver: Description and Performance Analysis","date":"2024-10-10","arxiv_id":"2410.07980","repositories_listed":0,"syntology":null},{"url":null,"slug":"balancing-pareto-front-exploration-of-non","title":"Balancing Pareto Front exploration of Non-dominated Tournament Genetic Algorithm (B-NTGA) in solving multi-objective NP-hard problems with constraints","date":"2024-10-08","arxiv_id":"2410.05701","repositories_listed":0,"syntology":null},{"url":null,"slug":"rethinking-selection-in-generational-genetic","title":"Rethinking Selection in Generational Genetic Algorithms to Solve Combinatorial Optimization Problems: An Upper Bound-based Parent Selection Strategy for Recombination","date":"2024-10-04","arxiv_id":"2410.03863","repositories_listed":0,"syntology":null},{"url":null,"slug":"credes-causal-reasoning-enhancement-and-dual","title":"CreDes: Causal Reasoning Enhancement and Dual-End Searching for Solving Long-Range Reasoning Problems using LLMs","date":"2024-10-02","arxiv_id":"2410.01696","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-2-approximation-algorithm-for-the-softwired","title":"A 2-approximation algorithm for the softwired parsimony problem on binary, tree-child phylogenetic networks","date":"2024-09-26","arxiv_id":"2409.18077","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-objective-evolution-of-heuristic-using","title":"Multi-objective Evolution of Heuristic Using Large Language Model","date":"2024-09-25","arxiv_id":"2409.16867","repositories_listed":0,"syntology":null},{"url":null,"slug":"quantum-evolutionary-algorithm-for-tsp","title":"Quantum evolutionary algorithm for TSP combinatorial optimisation problem","date":"2024-09-20","arxiv_id":"2409.13788","repositories_listed":0,"syntology":null},{"url":null,"slug":"extended-deep-submodular-functions","title":"Extended Deep Submodular Functions","date":"2024-09-18","arxiv_id":"2409.12053","repositories_listed":0,"syntology":null},{"url":null,"slug":"machine-learning-and-constraint-programming","title":"Machine Learning and Constraint Programming for Efficient Healthcare Scheduling","date":"2024-09-11","arxiv_id":"2409.07547","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-generative-model-for-mechanical-system","title":"Deep Generative Model for Mechanical System Configuration Design","date":"2024-09-09","arxiv_id":"2409.06016","repositories_listed":0,"syntology":null},{"url":null,"slug":"large-scale-urban-facility-location-selection","title":"Large-scale Urban Facility Location Selection with Knowledge-informed Reinforcement Learning","date":"2024-09-03","arxiv_id":"2409.01588","repositories_listed":0,"syntology":null},{"url":null,"slug":"unco-towards-unifying-neural-combinatorial","title":"Bridging Large Language Models and Optimization: A Unified Framework for Text-attributed Combinatorial Optimization","date":"2024-08-22","arxiv_id":"2408.12214","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-end-to-end-reinforcement-learning-based","title":"An End-to-End Reinforcement Learning Based Approach for Micro-View Order-Dispatching in Ride-Hailing","date":"2024-08-20","arxiv_id":"2408.10479","repositories_listed":0,"syntology":null},{"url":null,"slug":"grlinq-an-intelligent-spectrum-sharing","title":"GRLinQ: An Intelligent Spectrum Sharing Mechanism for Device-to-Device Communications with Graph Reinforcement Learning","date":"2024-08-18","arxiv_id":"2408.09394","repositories_listed":0,"syntology":null},{"url":null,"slug":"twin-sorting-dynamic-programming-assisted","title":"Twin Sorting Dynamic Programming Assisted User Association and Wireless Bandwidth Allocation for Hierarchical Federated Learning","date":"2024-08-17","arxiv_id":"2408.09076","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-estimation-of-regression-models-with","title":"Robust Estimation of Regression Models with Potentially Endogenous Outliers via a Modern Optimization Lens","date":"2024-08-07","arxiv_id":"2408.03930","repositories_listed":0,"syntology":null},{"url":null,"slug":"cool-fusion-fuse-large-language-models","title":"Cool-Fusion: Fuse Large Language Models without Training","date":"2024-07-29","arxiv_id":"2407.19807","repositories_listed":0,"syntology":null},{"url":null,"slug":"modeling-local-search-metaheuristics-using","title":"Modeling Local Search Metaheuristics Using Markov Decision Processes","date":"2024-07-29","arxiv_id":"2407.19904","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalization-bounds-of-surrogate-policies","title":"Generalization Bounds of Surrogate Policies for Combinatorial Optimization Problems","date":"2024-07-24","arxiv_id":"2407.17200","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhancing-gnns-performance-on-combinatorial","title":"Enhancing GNNs Performance on Combinatorial Optimization by Recurrent Feature Update","date":"2024-07-23","arxiv_id":"2407.16468","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalizing-and-unifying-gray-box","title":"Generalizing and Unifying Gray-box Combinatorial Optimization Operators","date":"2024-07-09","arxiv_id":"2407.06742","repositories_listed":0,"syntology":null},{"url":null,"slug":"vrsd-rethinking-similarity-and-diversity-for","title":"VRSD: Rethinking Similarity and Diversity for Retrieval in Large Language Models","date":"2024-07-05","arxiv_id":"2407.04573","repositories_listed":0,"syntology":null},{"url":null,"slug":"disco-efficient-diffusion-solver-for-large","title":"DISCO: Efficient Diffusion Solver for Large-Scale Combinatorial Optimization Problems","date":"2024-06-28","arxiv_id":"2406.19705","repositories_listed":0,"syntology":null},{"url":null,"slug":"beyond-statistical-estimation-differentially","title":"Beyond Statistical Estimation: Differentially Private Individual Computation via Shuffling","date":"2024-06-26","arxiv_id":"2406.18145","repositories_listed":0,"syntology":null},{"url":null,"slug":"link-prediction-with-untrained-message","title":"Link Prediction with Untrained Message Passing Layers","date":"2024-06-24","arxiv_id":"2406.16687","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-neural-networks-for-job-shop-scheduling","title":"Graph Neural Networks for Job Shop Scheduling Problems: A Survey","date":"2024-06-20","arxiv_id":"2406.14096","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-retrieve-iteratively-for-in","title":"Learning to Retrieve Iteratively for In-Context Learning","date":"2024-06-20","arxiv_id":"2406.14739","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-unified-framework-for-combinatorial","title":"A Unified Framework for Combinatorial Optimization Based on Graph Neural Networks","date":"2024-06-19","arxiv_id":"2406.13125","repositories_listed":0,"syntology":null},{"url":null,"slug":"archive-based-single-objective-evolutionary","title":"Archive-based Single-Objective Evolutionary Algorithms for Submodular Optimization","date":"2024-06-19","arxiv_id":"2406.13414","repositories_listed":0,"syntology":null},{"url":null,"slug":"combinatorial-reasoning-selecting-reasons-in","title":"Combinatorial Reasoning: Selecting Reasons in Generative AI Pipelines via Combinatorial Optimization","date":"2024-06-19","arxiv_id":"2407.00071","repositories_listed":0,"syntology":null},{"url":null,"slug":"dcdilp-a-distributed-learning-method-for","title":"DCILP: A Distributed Approach for Large-Scale Causal Structure Learning","date":"2024-06-15","arxiv_id":"2406.10481","repositories_listed":0,"syntology":null},{"url":null,"slug":"intertwining-cp-and-nlp-the-generation-of","title":"Intertwining CP and NLP: The Generation of Unreasonably Constrained Sentences","date":"2024-06-15","arxiv_id":"2406.15473","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-topological-analysis-of-the-space-of","title":"A topological analysis of the space of recipes","date":"2024-06-12","arxiv_id":"2406.09445","repositories_listed":0,"syntology":null},{"url":null,"slug":"charme-a-chain-based-reinforcement-learning","title":"CHARME: A chain-based reinforcement learning approach for the minor embedding problem","date":"2024-06-11","arxiv_id":"2406.07124","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-combinatorial-optimization-of","title":"Distributed Combinatorial Optimization of Downlink User Assignment in mmWave Cell-free Massive MIMO Using Graph Neural Networks","date":"2024-06-09","arxiv_id":"2406.05652","repositories_listed":0,"syntology":null},{"url":null,"slug":"gfpack-improving-2d-irregular-packing-by","title":"GFPack++: Improving 2D Irregular Packing by Learning Gradient Field with Attention","date":"2024-06-09","arxiv_id":"2406.07579","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-off-neuromorphic-ising-machines-using","title":"ON-OFF Neuromorphic ISING Machines using Fowler-Nordheim Annealers","date":"2024-06-07","arxiv_id":"2406.05224","repositories_listed":0,"syntology":null},{"url":null,"slug":"decision-focused-graph-neural-networks-for","title":"Decision-focused Graph Neural Networks for Combinatorial Optimization","date":"2024-06-05","arxiv_id":"2406.03647","repositories_listed":0,"syntology":null},{"url":null,"slug":"diffusion-inspired-quantum-noise-mitigation","title":"Diffusion-Inspired Quantum Noise Mitigation in Parameterized Quantum Circuits","date":"2024-06-02","arxiv_id":"2406.00843","repositories_listed":0,"syntology":null},{"url":null,"slug":"unveiling-the-lexical-sensitivity-of-llms","title":"Unveiling the Lexical Sensitivity of LLMs: Combinatorial Optimization for Prompt Enhancement","date":"2024-05-31","arxiv_id":"2405.20701","repositories_listed":0,"syntology":null},{"url":null,"slug":"xprompt-explaining-large-language-model-s","title":"XPrompt:Explaining Large Language Model's Generation via Joint Prompt Attribution","date":"2024-05-30","arxiv_id":"2405.20404","repositories_listed":0,"syntology":null},{"url":null,"slug":"metaheuristics-and-large-language-models-join","title":"Metaheuristics and Large Language Models Join Forces: Towards an Integrated Optimization Approach","date":"2024-05-28","arxiv_id":"2405.18272","repositories_listed":0,"syntology":null},{"url":null,"slug":"network-interdiction-goes-neural","title":"Network Interdiction Goes Neural","date":"2024-05-26","arxiv_id":"2405.16409","repositories_listed":0,"syntology":null},{"url":null,"slug":"randomized-heuristic-repair-for-large-scale","title":"Randomized heuristic repair for large-scale multidimensional knapsack problem","date":"2024-05-24","arxiv_id":"2405.15569","repositories_listed":0,"syntology":null},{"url":null,"slug":"actively-learning-combinatorial-optimization","title":"Actively Learning Combinatorial Optimization Using a Membership Oracle","date":"2024-05-23","arxiv_id":"2405.14090","repositories_listed":0,"syntology":null},{"url":null,"slug":"leader-reward-for-pomo-based-neural","title":"Leader Reward for POMO-Based Neural Combinatorial Optimization","date":"2024-05-22","arxiv_id":"2405.13947","repositories_listed":0,"syntology":null},{"url":null,"slug":"submodular-information-selection-for","title":"Submodular Information Selection for Hypothesis Testing with Misclassification Penalties","date":"2024-05-17","arxiv_id":"2405.10930","repositories_listed":0,"syntology":null},{"url":null,"slug":"using-combinatorial-optimization-to-design-a","title":"Using Combinatorial Optimization to Design a High quality LLM Solution","date":"2024-05-15","arxiv_id":"2405.13020","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-geometry-aware-pareto-set-learning","title":"Context-aware Diversity Enhancement for Neural Multi-Objective Combinatorial Optimization","date":"2024-05-14","arxiv_id":"2405.08604","repositories_listed":0,"syntology":null},{"url":null,"slug":"cobias-and-debias-minimizing-language-model","title":"The Curious Case of Class Accuracy Imbalance in LLMs: Post-hoc Debiasing via Nonlinear Integer Programming","date":"2024-05-13","arxiv_id":"2405.07623","repositories_listed":0,"syntology":null},{"url":null,"slug":"hamiltonian-based-quantum-reinforcement","title":"Hamiltonian-based Quantum Reinforcement Learning for Neural Combinatorial Optimization","date":"2024-05-13","arxiv_id":"2405.07790","repositories_listed":0,"syntology":null},{"url":null,"slug":"deploying-graph-neural-networks-in-wireless","title":"Deploying Graph Neural Networks in Wireless Networks: A Link Stability Viewpoint","date":"2024-05-09","arxiv_id":"2405.05802","repositories_listed":0,"syntology":null},{"url":null,"slug":"federated-combinatorial-multi-agent-multi","title":"Federated Combinatorial Multi-Agent Multi-Armed Bandits","date":"2024-05-09","arxiv_id":"2405.05950","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-anisotropic-smoothing-for-noisy","title":"Dynamic Anisotropic Smoothing for Noisy Derivative-Free Optimization","date":"2024-05-02","arxiv_id":"2405.01731","repositories_listed":0,"syntology":null},{"url":null,"slug":"early-years-of-biased-random-key-genetic","title":"Early years of Biased Random-Key Genetic Algorithms: A systematic review","date":"2024-05-02","arxiv_id":"2405.01765","repositories_listed":0,"syntology":null},{"url":null,"slug":"qoptlib-a-quantum-computing-oriented","title":"QOPTLib: a Quantum Computing Oriented Benchmark for Combinatorial Optimization Problems","date":"2024-04-24","arxiv_id":"2404.15852","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-support-relations-inference-and-scene","title":"On Support Relations Inference and Scene Hierarchy Graph Construction from Point Cloud in Clustered Environments","date":"2024-04-22","arxiv_id":"2404.13842","repositories_listed":0,"syntology":null},{"url":null,"slug":"large-language-models-can-plan-your-travels","title":"Large Language Models Can Solve Real-World Planning Rigorously with Formal Verification Tools","date":"2024-04-18","arxiv_id":"2404.11891","repositories_listed":0,"syntology":null},{"url":null,"slug":"fewer-truncations-improve-language-modeling","title":"Fewer Truncations Improve Language Modeling","date":"2024-04-16","arxiv_id":"2404.10830","repositories_listed":0,"syntology":null},{"url":null,"slug":"proposed-modified-computational-model-for-the","title":"Proposed modified computational model for the amoeba-inspired combinatorial optimization machine","date":"2024-04-10","arxiv_id":"2404.06828","repositories_listed":0,"syntology":null},{"url":null,"slug":"generative-pre-trained-transformer-for-2","title":"Generative Pre-Trained Transformer for Symbolic Regression Base In-Context Reinforcement Learning","date":"2024-04-09","arxiv_id":"2404.06330","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-reinforcement-learning-for","title":"Graph Reinforcement Learning for Combinatorial Optimization: A Survey and Unifying Perspective","date":"2024-04-09","arxiv_id":"2404.06492","repositories_listed":0,"syntology":null},{"url":null,"slug":"message-passing-variational-autoregressive","title":"Message Passing Variational Autoregressive Network for Solving Intractable Ising Models","date":"2024-04-09","arxiv_id":"2404.06225","repositories_listed":0,"syntology":null},{"url":null,"slug":"transform-then-explore-a-simple-and-effective","title":"Transform then Explore: a Simple and Effective Technique for Exploratory Combinatorial Optimization with Reinforcement Learning","date":"2024-04-06","arxiv_id":"2404.04661","repositories_listed":0,"syntology":null},{"url":null,"slug":"age-of-information-aware-distributed-task","title":"Distributed Task Offloading and Resource Allocation for Latency Minimization in Mobile Edge Computing Networks","date":"2024-04-04","arxiv_id":"2404.03154","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-reinforcement-learning-for-traveling","title":"Deep Reinforcement Learning for Traveling Purchaser Problems","date":"2024-04-03","arxiv_id":"2404.02476","repositories_listed":0,"syntology":null},{"url":null,"slug":"solving-the-qap-by-two-stage-graph-pointer","title":"Solving the QAP by Two-Stage Graph Pointer Networks and Reinforcement Learning","date":"2024-03-31","arxiv_id":"2404.00539","repositories_listed":0,"syntology":null},{"url":null,"slug":"self-improved-learning-for-scalable-neural","title":"Self-Improved Learning for Scalable Neural Combinatorial Optimization","date":"2024-03-28","arxiv_id":"2403.19561","repositories_listed":0,"syntology":null},{"url":null,"slug":"leveraging-constraint-programming-in-a-deep","title":"Leveraging Constraint Programming in a Deep Learning Approach for Dynamically Solving the Flexible Job-Shop Scheduling Problem","date":"2024-03-14","arxiv_id":"2403.09249","repositories_listed":0,"syntology":null},{"url":null,"slug":"surrogate-assisted-monte-carlo-tree-search-in","title":"Surrogate Assisted Monte Carlo Tree Search in Combinatorial Optimization","date":"2024-03-14","arxiv_id":"2403.09925","repositories_listed":0,"syntology":null}],"record_sha256":"fea3f1e79e6a2319ece1811c490562a5f334527e743a05a2211f76f099fa0855","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}