{"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/7","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":7,"pages_in_order":13,"rows_per_page":100,"rows":[601,700],"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/6","next":"/task/combinatorial-optimization/papers/8","papers":[{"url":null,"slug":"an-efficient-learning-based-solver-comparable","title":"An Efficient Learning-based Solver Comparable to Metaheuristics for the Capacitated Arc Routing Problem","date":"2024-03-11","arxiv_id":"2403.07028","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-reinforcement-learning-for-modelling","title":"Deep Reinforcement Learning for Modelling Protein Complexes","date":"2024-03-11","arxiv_id":"2405.02299","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-learning-for-parameter-prediction-of","title":"Graph Learning for Parameter Prediction of Quantum Approximate Optimization Algorithm","date":"2024-03-05","arxiv_id":"2403.03310","repositories_listed":0,"syntology":null},{"url":null,"slug":"how-multimodal-integration-boost-the","title":"How Multimodal Integration Boost the Performance of LLM for Optimization: Case Study on Capacitated Vehicle Routing Problems","date":"2024-03-04","arxiv_id":"2403.01757","repositories_listed":0,"syntology":null},{"url":null,"slug":"sequentialattention-for-block-sparsification","title":"SequentialAttention++ for Block Sparsification: Differentiable Pruning Meets Combinatorial Optimization","date":"2024-02-27","arxiv_id":"2402.17902","repositories_listed":0,"syntology":null},{"url":null,"slug":"cut-facets-and-cube-facets-of-lifted-multicut","title":"Box Facets and Cut Facets of Lifted Multicut Polytopes","date":"2024-02-26","arxiv_id":"2402.16814","repositories_listed":0,"syntology":null},{"url":null,"slug":"nonlinear-bayesian-optimal-experimental","title":"Nonlinear Bayesian optimal experimental design using logarithmic Sobolev inequalities","date":"2024-02-23","arxiv_id":"2402.15053","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-principled-task-grouping-for-multi","title":"Towards Principled Task Grouping for Multi-Task Learning","date":"2024-02-23","arxiv_id":"2402.15328","repositories_listed":0,"syntology":null},{"url":null,"slug":"convergence-acceleration-of-markov-chain","title":"Convergence Acceleration of Markov Chain Monte Carlo-based Gradient Descent by Deep Unfolding","date":"2024-02-21","arxiv_id":"2402.13608","repositories_listed":0,"syntology":null},{"url":null,"slug":"polynet-learning-diverse-solution-strategies","title":"PolyNet: Learning Diverse Solution Strategies for Neural Combinatorial Optimization","date":"2024-02-21","arxiv_id":"2402.14048","repositories_listed":0,"syntology":null},{"url":null,"slug":"reasoning-algorithmically-in-graph-neural","title":"Reasoning Algorithmically in Graph Neural Networks","date":"2024-02-21","arxiv_id":"2402.13744","repositories_listed":0,"syntology":null},{"url":null,"slug":"ritfis-robust-input-testing-framework-for","title":"RITFIS: Robust input testing framework for LLMs-based intelligent software","date":"2024-02-21","arxiv_id":"2402.13518","repositories_listed":0,"syntology":null},{"url":null,"slug":"large-scale-constrained-clustering-with","title":"Large Scale Constrained Clustering With Reinforcement Learning","date":"2024-02-15","arxiv_id":"2402.10177","repositories_listed":0,"syntology":null},{"url":null,"slug":"low-rank-extragradient-methods-for-scalable","title":"Low-Rank Extragradient Methods for Scalable Semidefinite Optimization","date":"2024-02-14","arxiv_id":"2402.09081","repositories_listed":0,"syntology":null},{"url":null,"slug":"assortment-planning-with-sponsored-products","title":"Assortment Planning with Sponsored Products","date":"2024-02-09","arxiv_id":"2402.06158","repositories_listed":0,"syntology":null},{"url":null,"slug":"simulated-overparameterization","title":"Majority Kernels: An Approach to Leverage Big Model Dynamics for Efficient Small Model Training","date":"2024-02-07","arxiv_id":"2402.05033","repositories_listed":0,"syntology":null},{"url":null,"slug":"effective-anytime-algorithm-for","title":"Effective anytime algorithm for multiobjective combinatorial optimization problems","date":"2024-02-06","arxiv_id":"2403.08807","repositories_listed":0,"syntology":null},{"url":null,"slug":"torchmsat-a-gpu-accelerated-approximation-to","title":"torchmSAT: A GPU-Accelerated Approximation To The Maximum Satisfiability Problem","date":"2024-02-06","arxiv_id":"2402.03640","repositories_listed":0,"syntology":null},{"url":null,"slug":"accelerating-matroid-optimization-through","title":"Accelerating Matroid Optimization through Fast Imprecise Oracles","date":"2024-02-05","arxiv_id":"2402.02774","repositories_listed":0,"syntology":null},{"url":null,"slug":"continuous-tensor-relaxation-for-finding","title":"Continuous Tensor Relaxation for Finding Diverse Solutions in Combinatorial Optimization Problems","date":"2024-02-03","arxiv_id":"2402.02190","repositories_listed":0,"syntology":null},{"url":null,"slug":"manipulating-predictions-over-discrete-inputs","title":"Manipulating Predictions over Discrete Inputs in Machine Teaching","date":"2024-01-31","arxiv_id":"2401.17865","repositories_listed":0,"syntology":null},{"url":null,"slug":"attention-based-reinforcement-learning-for-1","title":"Attention-based Reinforcement Learning for Combinatorial Optimization: Application to Job Shop Scheduling Problem","date":"2024-01-29","arxiv_id":"2401.16580","repositories_listed":0,"syntology":null},{"url":null,"slug":"quantum-inspired-machine-learning-for","title":"Quantum-Inspired Machine Learning for Molecular Docking","date":"2024-01-22","arxiv_id":"2401.12999","repositories_listed":0,"syntology":null},{"url":null,"slug":"decentralizing-coordination-in-open-vehicle","title":"Decentralizing Coordination in Open Vehicle Fleets for Scalable and Dynamic Task Allocation","date":"2024-01-19","arxiv_id":"2401.10965","repositories_listed":0,"syntology":null},{"url":null,"slug":"power-system-fault-diagnosis-with-quantum","title":"Power System Fault Diagnosis with Quantum Computing and Efficient Gate Decomposition","date":"2024-01-18","arxiv_id":"2401.09800","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-q-learning-for-combinatorial","title":"Graph Q-Learning for Combinatorial Optimization","date":"2024-01-11","arxiv_id":"2401.05610","repositories_listed":0,"syntology":null},{"url":null,"slug":"quantum-hybrid-stereo-matching-with-nonlinear","title":"Quantum-Hybrid Stereo Matching With Nonlinear Regularization and Spatial Pyramids","date":"2023-12-26","arxiv_id":"2312.16118","repositories_listed":0,"syntology":null},{"url":null,"slug":"nn-steiner-a-mixed-neural-algorithmic","title":"NN-Steiner: A Mixed Neural-algorithmic Approach for the Rectilinear Steiner Minimum Tree Problem","date":"2023-12-17","arxiv_id":"2312.10589","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-unified-pre-training-and-adaptation","title":"A Unified Pre-training and Adaptation Framework for Combinatorial Optimization on Graphs","date":"2023-12-16","arxiv_id":"2312.11547","repositories_listed":0,"syntology":null},{"url":null,"slug":"symmetry-breaking-and-equivariant-neural","title":"Symmetry Breaking and Equivariant Neural Networks","date":"2023-12-14","arxiv_id":"2312.09016","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-simulated-annealing-based-multiobjective","title":"A Simulated Annealing-Based Multiobjective Optimization Algorithm for Minimum Weight Minimum Connected Dominating Set Problem","date":"2023-12-13","arxiv_id":"2312.11527","repositories_listed":0,"syntology":null},{"url":null,"slug":"machine-learning-for-the-multi-dimensional","title":"Machine Learning for the Multi-Dimensional Bin Packing Problem: Literature Review and Empirical Evaluation","date":"2023-12-13","arxiv_id":"2312.08103","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-novel-differentiable-loss-function-for","title":"A Novel Differentiable Loss Function for Unsupervised Graph Neural Networks in Graph Partitioning","date":"2023-12-11","arxiv_id":"2312.06877","repositories_listed":0,"syntology":null},{"url":null,"slug":"characterization-of-locality-in-spin-states","title":"Characterization of Locality in Spin States and Forced Moves for Optimizations","date":"2023-12-05","arxiv_id":"2312.02544","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-the-inferrence-of-structural","title":"Towards the Inferrence of Structural Similarity of Combinatorial Landscapes","date":"2023-12-05","arxiv_id":"2312.02720","repositories_listed":0,"syntology":null},{"url":null,"slug":"pointer-networks-trained-better-via","title":"Pointer Networks Trained Better via Evolutionary Algorithms","date":"2023-12-02","arxiv_id":"2312.01150","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-bayesian-approach-for-prompt-optimization","title":"A Bayesian approach for prompt optimization in pre-trained language models","date":"2023-12-01","arxiv_id":"2312.00471","repositories_listed":0,"syntology":null},{"url":null,"slug":"biased-random-key-genetic-algorithms-a-review","title":"Biased Random-Key Genetic Algorithms: A Review","date":"2023-12-01","arxiv_id":"2312.00961","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-graph-neural-network-based-qubo-formulated","title":"A Graph Neural Network-Based QUBO-Formulated Hamiltonian-Inspired Loss Function for Combinatorial Optimization using Reinforcement Learning","date":"2023-11-27","arxiv_id":"2311.16277","repositories_listed":0,"syntology":null},{"url":null,"slug":"exact-combinatorial-optimization-with-temporo","title":"Exact Combinatorial Optimization with Temporo-Attentional Graph Neural Networks","date":"2023-11-23","arxiv_id":"2311.13843","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-lattice-reduction-a-self-supervised","title":"Neural Lattice Reduction: A Self-Supervised Geometric Deep Learning Approach","date":"2023-11-14","arxiv_id":"2311.08170","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-expandable-machine-learning-optimization","title":"An Expandable Machine Learning-Optimization Framework to Sequential Decision-Making","date":"2023-11-12","arxiv_id":"2311.06972","repositories_listed":0,"syntology":null},{"url":null,"slug":"riga-a-regret-based-interactive-genetic","title":"RIGA: A Regret-Based Interactive Genetic Algorithm","date":"2023-11-10","arxiv_id":"2311.06063","repositories_listed":0,"syntology":null},{"url":null,"slug":"amplitude-ensemble-quantum-inspired-tabu","title":"Amplitude-Ensemble Quantum-Inspired Tabu Search Algorithm for Solving 0/1 Knapsack Problems","date":"2023-11-08","arxiv_id":"2311.12867","repositories_listed":0,"syntology":null},{"url":null,"slug":"computing-with-residue-numbers-in-high","title":"Computing with Residue Numbers in High-Dimensional Representation","date":"2023-11-08","arxiv_id":"2311.04872","repositories_listed":0,"syntology":null},{"url":null,"slug":"pointer-networks-with-q-learning-for-op","title":"Pointer Networks with Q-Learning for Combinatorial Optimization","date":"2023-11-05","arxiv_id":"2311.02629","repositories_listed":0,"syntology":null},{"url":null,"slug":"addressing-the-knapsack-challenge-through","title":"Addressing The Knapsack Challenge Through Cultural Algorithm Optimization","date":"2023-10-30","arxiv_id":"2401.03324","repositories_listed":0,"syntology":null},{"url":null,"slug":"unveiling-the-limits-of-learned-local-search","title":"Unveiling the Limits of Learned Local Search Heuristics: Are You the Mightiest of the Meek?","date":"2023-10-30","arxiv_id":"2310.19990","repositories_listed":0,"syntology":null},{"url":null,"slug":"mag-gnn-reinforcement-learning-boosted-graph","title":"MAG-GNN: Reinforcement Learning Boosted Graph Neural Network","date":"2023-10-29","arxiv_id":"2310.19142","repositories_listed":0,"syntology":null},{"url":null,"slug":"high-dimensional-prediction-for-sequential","title":"High-Dimensional Prediction for Sequential Decision Making","date":"2023-10-26","arxiv_id":"2310.17651","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-packing-from-visual-sensing-to","title":"Neural Packing: from Visual Sensing to Reinforcement Learning","date":"2023-10-17","arxiv_id":"2311.09233","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-permutation-symmetries-in-bayesian-neural","title":"On permutation symmetries in Bayesian neural network posteriors: a variational perspective","date":"2023-10-16","arxiv_id":"2310.10171","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhancing-column-generation-by-reinforcement","title":"Enhancing Column Generation by Reinforcement Learning-Based Hyper-Heuristic for Vehicle Routing and Scheduling Problems","date":"2023-10-15","arxiv_id":"2310.09686","repositories_listed":0,"syntology":null},{"url":null,"slug":"grasp-accelerating-shortest-path-attacks-via","title":"GRASP: Accelerating Shortest Path Attacks via Graph Attention","date":"2023-10-12","arxiv_id":"2310.07980","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-edge-aware-graph-autoencoder-trained-on","title":"An Edge-Aware Graph Autoencoder Trained on Scale-Imbalanced Data for Traveling Salesman Problems","date":"2023-10-10","arxiv_id":"2310.06543","repositories_listed":0,"syntology":null},{"url":null,"slug":"diversity-from-human-feedback","title":"Diversity from Human Feedback","date":"2023-10-10","arxiv_id":"2310.06648","repositories_listed":0,"syntology":null},{"url":null,"slug":"oracle-efficient-algorithms-for-groupwise","title":"Oracle Efficient Algorithms for Groupwise Regret","date":"2023-10-07","arxiv_id":"2310.04652","repositories_listed":0,"syntology":null},{"url":null,"slug":"routing-arena-a-benchmark-suite-for-neural","title":"Routing Arena: A Benchmark Suite for Neural Routing Solvers","date":"2023-10-06","arxiv_id":"2310.04140","repositories_listed":0,"syntology":null},{"url":null,"slug":"genco-generating-diverse-solutions-to-design","title":"GenCO: Generating Diverse Designs with Combinatorial Constraints","date":"2023-10-03","arxiv_id":"2310.02442","repositories_listed":0,"syntology":null},{"url":null,"slug":"genetic-engineering-algorithm-gea-an","title":"Genetic Engineering Algorithm (GEA): An Efficient Metaheuristic Algorithm for Solving Combinatorial Optimization Problems","date":"2023-09-28","arxiv_id":"2309.16413","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhancing-network-resilience-through-machine","title":"Enhancing Network Resilience through Machine Learning-powered Graph Combinatorial Optimization: Applications in Cyber Defense and Information Diffusion","date":"2023-09-22","arxiv_id":"2310.10667","repositories_listed":0,"syntology":null},{"url":null,"slug":"constraints-first-a-new-mdd-based-model-to","title":"Constraints First: A New MDD-based Model to Generate Sentences Under Constraints","date":"2023-09-21","arxiv_id":"2309.12415","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-ldpc-decoding-using-physical","title":"Efficient LDPC Decoding using Physical Computation","date":"2023-09-21","arxiv_id":"2312.02161","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-passive-active-irs-enhanced-wireless","title":"Multi-Passive/Active-IRS Enhanced Wireless Coverage: Deployment Optimization and Cost-Performance Trade-off","date":"2023-09-21","arxiv_id":"2309.11918","repositories_listed":0,"syntology":null},{"url":null,"slug":"user-assignment-and-resource-allocation-for","title":"User Assignment and Resource Allocation for Hierarchical Federated Learning over Wireless Networks","date":"2023-09-17","arxiv_id":"2309.09253","repositories_listed":0,"syntology":null},{"url":null,"slug":"understanding-the-usage-of-qubo-based","title":"A Graph Neural Network-Based QUBO-Formulated Hamiltonian-Inspired Loss Function for Combinatorial Optimization using Reinforcement Learning","date":"2023-08-27","arxiv_id":"2308.13978","repositories_listed":0,"syntology":null},{"url":null,"slug":"multitasking-evolutionary-algorithm-based-on","title":"Multitasking Evolutionary Algorithm Based on Adaptive Seed Transfer for Combinatorial Problem","date":"2023-08-24","arxiv_id":"2308.12647","repositories_listed":0,"syntology":null},{"url":null,"slug":"accelerating-exact-combinatorial-optimization","title":"Accelerating Exact Combinatorial Optimization via RL-based Initialization -- A Case Study in Scheduling","date":"2023-08-19","arxiv_id":"2308.11652","repositories_listed":0,"syntology":null},{"url":null,"slug":"accelerating-diffusion-based-combinatorial","title":"Accelerating Diffusion-based Combinatorial Optimization Solvers by Progressive Distillation","date":"2023-08-12","arxiv_id":"2308.06644","repositories_listed":0,"syntology":null},{"url":null,"slug":"vn-solver-vision-based-neural-solver-for","title":"VN-Solver: Vision-based Neural Solver for Combinatorial Optimization over Graphs","date":"2023-08-06","arxiv_id":"2308.03185","repositories_listed":0,"syntology":null},{"url":null,"slug":"threshold-aware-learning-to-generate-feasible","title":"Threshold-aware Learning to Generate Feasible Solutions for Mixed Integer Programs","date":"2023-08-01","arxiv_id":"2308.00327","repositories_listed":0,"syntology":null},{"url":null,"slug":"route-planning-using-nature-inspired","title":"Route Planning Using Nature-Inspired Algorithms","date":"2023-07-22","arxiv_id":"2307.12133","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-accelerating-benders-decomposition","title":"Accelerating Cutting-Plane Algorithms via Reinforcement Learning Surrogates","date":"2023-07-17","arxiv_id":"2307.08816","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficiently-factorizing-boolean-matrices","title":"Efficiently Factorizing Boolean Matrices using Proximal Gradient Descent","date":"2023-07-14","arxiv_id":"2307.07615","repositories_listed":0,"syntology":null},{"url":null,"slug":"nested-elimination-a-simple-algorithm-for","title":"Learning to Select and Rank from Choice-Based Feedback: A Simple Nested Approach","date":"2023-07-13","arxiv_id":"2307.09295","repositories_listed":0,"syntology":null},{"url":null,"slug":"transformers-in-reinforcement-learning-a","title":"Transformers in Reinforcement Learning: A Survey","date":"2023-07-12","arxiv_id":"2307.05979","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-graph-multi-separator-problem-for-image","title":"A Graph Multi-separator Problem for Image Segmentation","date":"2023-07-10","arxiv_id":"2307.04592","repositories_listed":0,"syntology":null},{"url":null,"slug":"large-language-models-for-supply-chain","title":"Large Language Models for Supply Chain Optimization","date":"2023-07-08","arxiv_id":"2307.03875","repositories_listed":0,"syntology":null},{"url":null,"slug":"noisy-tensor-ring-approximation-for-computing","title":"Noisy Tensor Ring approximation for computing gradients of Variational Quantum Eigensolver for Combinatorial Optimization","date":"2023-07-08","arxiv_id":"2307.03884","repositories_listed":0,"syntology":null},{"url":null,"slug":"variational-quantum-regression-algorithm-with","title":"Explainable quantum regression algorithm with encoded data structure","date":"2023-07-07","arxiv_id":"2307.03334","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-branch-in-combinatorial","title":"Learning to Branch in Combinatorial Optimization with Graph Pointer Networks","date":"2023-07-04","arxiv_id":"2307.01434","repositories_listed":0,"syntology":null},{"url":null,"slug":"object-detection-based-on-the-collection-of","title":"Object Detection based on the Collection of Geometric Evidence","date":"2023-06-25","arxiv_id":"2306.14120","repositories_listed":0,"syntology":null},{"url":null,"slug":"minimizing-energy-consumption-in-mu-mimo-via","title":"Minimizing Energy Consumption in MU-MIMO via Antenna Muting by Neural Networks with Asymmetric Loss","date":"2023-06-08","arxiv_id":"2306.05162","repositories_listed":0,"syntology":null},{"url":null,"slug":"barriers-for-the-performance-of-graph-neural","title":"Barriers for the performance of graph neural networks (GNN) in discrete random structures. A comment on~\\cite{schuetz2022combinatorial},\\cite{angelini2023modern},\\cite{schuetz2023reply}","date":"2023-06-05","arxiv_id":"2306.02555","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-algorithms-for-matroid-submodular","title":"Dynamic Algorithms for Matroid Submodular Maximization","date":"2023-06-01","arxiv_id":"2306.00959","repositories_listed":0,"syntology":null},{"url":null,"slug":"clustering-method-for-time-series-images","title":"Clustering Method for Time-Series Images Using Quantum-Inspired Computing Technology","date":"2023-05-26","arxiv_id":"2305.16656","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-first-proven-performance-guarantees-for","title":"The First Proven Performance Guarantees for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II) on a Combinatorial Optimization Problem","date":"2023-05-22","arxiv_id":"2305.13459","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-bee-colony-optimization-a-case-study","title":"Neural Bee Colony Optimization: A Case Study in Public Transit Network Design","date":"2023-05-18","arxiv_id":"2306.00720","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-training-of-multi-task-neural","title":"Efficient Training of Multi-task Combinarotial Neural Solver with Multi-armed Bandits","date":"2023-05-10","arxiv_id":"2305.06361","repositories_listed":0,"syntology":null},{"url":null,"slug":"assessment-of-reinforcement-learning","title":"Assessment of Reinforcement Learning Algorithms for Nuclear Power Plant Fuel Optimization","date":"2023-05-09","arxiv_id":"2305.05812","repositories_listed":0,"syntology":null},{"url":null,"slug":"near-optimal-los-and-orientation-aware","title":"Near-Optimal LOS and Orientation Aware Intelligent Reflecting Surface Placement","date":"2023-05-05","arxiv_id":"2305.03451","repositories_listed":0,"syntology":null},{"url":null,"slug":"quantum-based-combinatorial-optimization-for","title":"Quantum-Based Combinatorial Optimization for Optimal Sensor Placement in Civil Structures","date":"2023-05-03","arxiv_id":"2305.08738","repositories_listed":0,"syntology":null},{"url":null,"slug":"local-search-for-integer-linear-programming","title":"New Characterizations and Efficient Local Search for General Integer Linear Programming","date":"2023-04-29","arxiv_id":"2305.00188","repositories_listed":0,"syntology":null},{"url":null,"slug":"monotone-comparative-statics-for-submodular","title":"Monotone comparative statics for submodular functions, with an application to aggregated deferred acceptance","date":"2023-04-24","arxiv_id":"2304.12171","repositories_listed":0,"syntology":null},{"url":"/paper/layernas-neural-architecture-search-in","slug":"layernas-neural-architecture-search-in","title":"LayerNAS: Neural Architecture Search in Polynomial Complexity","date":"2023-04-23","arxiv_id":"2304.11517","repositories_listed":0,"syntology":null},{"url":null,"slug":"genetic-algorithm-based-combinatorial","title":"Genetic Algorithm Based Combinatorial Optimization for the Optimal Design of Water Distribution Network of Gurudeniya Service Zone, Sri Lanka","date":"2023-04-19","arxiv_id":"2304.09720","repositories_listed":0,"syntology":null},{"url":null,"slug":"quantum-annealing-for-single-image-super","title":"Quantum Annealing for Single Image Super-Resolution","date":"2023-04-18","arxiv_id":"2304.08924","repositories_listed":0,"syntology":null},{"url":null,"slug":"rels-dqn-a-robust-and-efficient-local-search","title":"RELS-DQN: A Robust and Efficient Local Search Framework for Combinatorial Optimization","date":"2023-04-11","arxiv_id":"2304.06048","repositories_listed":0,"syntology":null},{"url":null,"slug":"doubly-stochastic-matrix-models-for","title":"Doubly Stochastic Matrix Models for Estimation of Distribution Algorithms","date":"2023-04-05","arxiv_id":"2304.02458","repositories_listed":0,"syntology":null},{"url":null,"slug":"spatial-photonic-boltzmann-machines-low-rank","title":"Low-rank combinatorial optimization and statistical learning by spatial photonic Ising machine","date":"2023-03-27","arxiv_id":"2303.14993","repositories_listed":0,"syntology":null}],"record_sha256":"aff42680db77077b69733e3b373799b35aed1416bd612ac054da8118e37be159","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}