On the public citation graph

A neural network algorithm for the multiple traveling salesmen problem

https://doi.org/10.1007/bf00204755

0 signed · 87 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/net.3230040205openalex-snapshot

Routing a fleet of M vehicles to/from a central facility

inferredcites →https://doi.org/10.1002/net.3230120402openalex-snapshot

Topological design of centralized computer networks—formulations and algorithms

inferredcites →https://doi.org/10.1007/bf00339943openalex-snapshot

“Neural” computation of decisions in optimization problems

inferredcites →https://doi.org/10.1007/bf00363956openalex-snapshot

On the stability of the Travelling Salesman Problem algorithm of Hopfield and Tank

inferredcites →https://doi.org/10.1007/bf00940812openalex-snapshot

Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm

inferredcites →https://doi.org/10.1016/0375-9601(87)90796-1openalex-snapshot

Fast simulated annealing

inferredcites →https://doi.org/10.1051/jphys:019850046080127700openalex-snapshot

Configuration space analysis of travelling salesman problems

inferredcites →https://doi.org/10.1057/jors.1969.75openalex-snapshot

An Algorithm for the Vehicle-dispatching Problem

inferredcites →https://doi.org/10.1073/pnas.81.10.3088openalex-snapshot

Neurons with graded response have collective computational properties like those of two-state neurons.

inferredcites →https://doi.org/10.1109/tsmc.1983.6313075openalex-snapshot

Absolute stability of global pattern formation and parallel memory storage by competitive neural networks

inferredcites →https://doi.org/10.1137/1026105openalex-snapshot

The N -City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm

inferredcites →https://doi.org/10.1145/322358.322367openalex-snapshot

Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem

inferredcites →https://doi.org/10.1145/63047.63105openalex-snapshot

A concurrent neural network algorithm for the traveling salesman problem

inferredcites →https://doi.org/10.1209/0295-5075/2/12/006openalex-snapshot

Statistical Mechanics and the Travelling Salesman Problem

inferredcites →https://doi.org/10.1287/mnsc.18.6.b279openalex-snapshot

Computer-Assisted School Bus Scheduling

inferredcites →https://doi.org/10.5555/800044.801546openalex-snapshot

Optimization by simulated annealing: A preliminary computational study for the TSP

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9780470612491.ch9openalex-snapshot

An Overview of Applications

inferred← citeshttps://doi.org/10.1002/asjc.2507openalex-snapshot

An improved Hopfield Lagrange network with application on motor efficiency optimization

inferred← citeshttps://doi.org/10.1007/3-540-60793-5_90openalex-snapshot

Parallel distributed relaxation labeling

inferred← citeshttps://doi.org/10.1007/978-1-4615-2223-2_15openalex-snapshot

Neural Networks for Heuristic Selection: An Application in Resource-Constrained Project Scheduling

inferred← citeshttps://doi.org/10.1007/978-3-319-05035-5_2openalex-snapshot

Survey of Methodologies for TSP and VRP

inferred← citeshttps://doi.org/10.1007/978-3-642-84338-9_46openalex-snapshot

Dispatching Mobile Robots in Flexible Manufacturing Systems: The Issues and Problems

inferred← citeshttps://doi.org/10.1007/978-3-642-85838-3_46openalex-snapshot

Dispatching Mobile Robots in Flexible Manufacturing Systems: The Issues and Problems

inferred← citeshttps://doi.org/10.1007/978-3-662-02952-7_23openalex-snapshot

Choosing Solvers in Decision Support Systems: A Neural Network Application in Resource-Constrained Project Scheduling

inferred← citeshttps://doi.org/10.1007/978-94-011-0713-6_8openalex-snapshot

Scheduling

inferred← citeshttps://doi.org/10.1007/bf01473902openalex-snapshot

Design of a real-time AND/OR assembly scheduler on an optimization neural network

inferred← citeshttps://doi.org/10.1007/bf02125421openalex-snapshot

Metaheuristics: A bibliography

inferred← citeshttps://doi.org/10.1007/s00422-024-01002-0openalex-snapshot

Beyond the Nobel prizes: towards new synergies between Computational Neuroscience and Artificial Intelligence

inferred← citeshttps://doi.org/10.1016/0045-7906(93)90039-topenalex-snapshot

Multiple job scheduling with artificial neural networks

inferred← citeshttps://doi.org/10.1016/0305-0548(92)90044-6openalex-snapshot

Neural network methods in combinatorial optimization

inferred← citeshttps://doi.org/10.1016/0378-3758(92)90092-7openalex-snapshot

Stochastic methods for neural systems

inferred← citeshttps://doi.org/10.1016/j.asoc.2010.03.002openalex-snapshot

An ant colony algorithm for solving fixed destination multi-depot multiple traveling salesmen problems

inferred← citeshttps://doi.org/10.1016/j.asoc.2017.12.031openalex-snapshot

A comparative study of improved GA and PSO in solving multiple traveling salesmen problem

inferred← citeshttps://doi.org/10.1016/j.asoc.2018.11.048openalex-snapshot

Mission-oriented ant-team ACO for min–max MTSP

inferred← citeshttps://doi.org/10.1016/j.cie.2015.10.010openalex-snapshot

A general variable neighborhood search heuristic for multiple traveling salesmen problem

inferred← citeshttps://doi.org/10.1016/j.cor.2020.105192openalex-snapshot

Modeling and optimization of multiple traveling salesmen problems: An evolution strategy approach

inferred← citeshttps://doi.org/10.1016/j.engappai.2014.05.012openalex-snapshot

Aggregate Reinforcement Learning for multi-agent territory division: The Hide-and-Seek game

inferred← citeshttps://doi.org/10.1016/j.jag.2024.103863openalex-snapshot

BiGNN: Bipartite graph neural network with attention mechanism for solving multiple traveling salesman problems in urban logistics

inferred← citeshttps://doi.org/10.1016/j.neunet.2008.09.008openalex-snapshot

A deterministic annealing algorithm for approximating a solution of the min-bisection problem

inferred← citeshttps://doi.org/10.1016/j.neunet.2011.03.018openalex-snapshot

A deterministic annealing algorithm for the minimum concave cost network flow problem

inferred← citeshttps://doi.org/10.1016/j.neunet.2012.12.002openalex-snapshot

A deterministic annealing algorithm for approximating a solution of the linearly constrained nonconvex quadratic minimization problem

inferred← citeshttps://doi.org/10.1016/j.omega.2004.10.004openalex-snapshot

The multiple traveling salesman problem: an overview of formulations and solution procedures

inferred← citeshttps://doi.org/10.1016/s0031-3203(97)00024-1openalex-snapshot

Relaxation labeling using augmented lagrange-hopfield method

inferred← citeshttps://doi.org/10.1016/s0263-2241(98)00023-2openalex-snapshot

Optimization of the measuring path on a coordinate measuring machine using genetic algorithms

inferred← citeshttps://doi.org/10.1016/s0893-6080(00)00064-2openalex-snapshot

Approximating a solution of the s–t max-cut problem with a deterministic annealing algorithm

inferred← citeshttps://doi.org/10.1016/s0893-6080(00)00092-7openalex-snapshot

A globally convergent Lagrange and barrier function iterative algorithm for the traveling salesman problem

inferred← citeshttps://doi.org/10.1016/s0893-6080(02)00027-8openalex-snapshot

A deterministic annealing algorithm for approximating a solution of the max-bisection problem

inferred← citeshttps://doi.org/10.1016/s0954-1810(00)00008-xopenalex-snapshot

A neural network approach for a robot task sequencing problem

inferred← citeshttps://doi.org/10.1023/a:1018952406004openalex-snapshot

Connectionist approaches for solver selection in constrained project scheduling

inferred← citeshttps://doi.org/10.1061/(asce)cp.1943-5487.0000687openalex-snapshot

Task Allocation and Route Planning for Robotic Service Networks in Indoor Building Environments

inferred← citeshttps://doi.org/10.1063/5.0110697openalex-snapshot

Optimum trajectory of multi-UAV for fertilization of paddy fields using ant colony optimization (ACO) and 2-opt algorithms

inferred← citeshttps://doi.org/10.1109/26.275311openalex-snapshot

A neural network approach to routing without interference in multihop radio networks

inferred← citeshttps://doi.org/10.1109/26.380169openalex-snapshot

A neural network approach to solving the link activation problem in multihop radio networks

inferred← citeshttps://doi.org/10.1109/70.833193openalex-snapshot

Lagrangian relaxation neural networks for job shop scheduling

inferred← citeshttps://doi.org/10.1109/72.548179openalex-snapshot

Improving convergence and solution quality of Hopfield-type neural networks with augmented Lagrange multipliers

inferred← citeshttps://doi.org/10.1109/access.2020.2973607openalex-snapshot

An Efficient, Scalable, and Robust Neuro-Processor-Based Concept for Solving Single-Cycle Traveling Salesman Problems in Complex and Dynamically Reconfigurable Graph Networks

inferred← citeshttps://doi.org/10.1109/cdc.1997.652404openalex-snapshot

Topological design of interconnected LANs using Hopfield neural networks

inferred← citeshttps://doi.org/10.1109/eeis.1991.217697openalex-snapshot

Application of neural networks techniques for 2-D emission tomography

inferred← citeshttps://doi.org/10.1109/icip.1995.529697openalex-snapshot

Relaxation labeling using Lagrange-Hopfield method

inferred← citeshttps://doi.org/10.1109/ijcnn.2003.1223780openalex-snapshot

Distribution approximation, combinatorial optimization, and Lagrange-Barrier

inferred← citeshttps://doi.org/10.1109/infcom.1991.147623openalex-snapshot

A neural network approach to routing in multihop radio networks

inferred← citeshttps://doi.org/10.1109/iscas.1991.176682openalex-snapshot

A study of feature-mapped approach to the multiple travelling salesmen problem

inferred← citeshttps://doi.org/10.1109/isda.2014.7066271openalex-snapshot

GELS-GA: Hybrid metaheuristic algorithm for solving Multiple Travelling Salesman Problem

inferred← citeshttps://doi.org/10.1109/isit.1991.695211openalex-snapshot

Sequential Link Activation In Multihop Radio Networks By Means Of Hopfield Neural Network Techniques

inferred← citeshttps://doi.org/10.1109/lra.2021.3091695openalex-snapshot

Multi-Tour Set Traveling Salesman Problem in Planning Power Transmission Line Inspection

inferred← citeshttps://doi.org/10.1109/milcom.1991.258284openalex-snapshot

Neural network techniques for scheduling and routing problems in multihop radio networks

inferred← citeshttps://doi.org/10.1109/robot.1991.131688openalex-snapshot

Scheduling with neural networks for flexible manufacturing systems

inferred← citeshttps://doi.org/10.1109/robot.1998.677428openalex-snapshot

Lagrangian relaxation neural networks for job shop scheduling

inferred← citeshttps://doi.org/10.1109/uic-atc.2017.8397396openalex-snapshot

Tour planning for crowdsourcing sensor data collection

inferred← citeshttps://doi.org/10.1155/2020/3431420openalex-snapshot

Experimental Study of a Hybrid Genetic Algorithm for the Multiple Travelling Salesman Problem

inferred← citeshttps://doi.org/10.1155/2020/5748680openalex-snapshot

Product Service Scheduling Problem with Service Matching Based on Tabu Search Method

inferred← citeshttps://doi.org/10.1155/2021/5536574openalex-snapshot

The Application of an Adaptive Genetic Algorithm Based on Collision Detection in Path Planning of Mobile Robots

inferred← citeshttps://doi.org/10.1162/08997660252741130openalex-snapshot

A Lagrange Multiplier and Hopfield-Type Barrier Function Method for the Traveling Salesman Problem

inferred← citeshttps://doi.org/10.1287/ijoc.11.1.15openalex-snapshot

Neural Networks for Combinatorial Optimization: A Review of More Than a Decade of Research

inferred← citeshttps://doi.org/10.1287/trsc.2021.1075openalex-snapshot

A Special Case of the Multiple Traveling Salesmen Problem in End-of-Aisle Picking Systems

inferred← citeshttps://doi.org/10.13182/nt95-a35120openalex-snapshot

Artificial Neural Networks Optimization Method for Radioactive Source Localization

inferred← citeshttps://doi.org/10.14569/ijacsa.2020.0110768openalex-snapshot

Genetic Algorithms for the Multiple Travelling Salesman Problem

inferred← citeshttps://doi.org/10.1541/ieejeiss.124.1312openalex-snapshot

A Learning Algorithm of Elastic Net for Multiple Traveling Salesmen Problem

inferred← citeshttps://doi.org/10.22436/jmcs.04.03.17openalex-snapshot

Using A Hybrid Simulated Annealing And Genetic Algorithms For Non Fixed Destination Multi-depot Multiple Traveling Salesmen Problem With Time Window And Waiting Penalty

inferred← citeshttps://doi.org/10.23860/diss-steinhaus-meghan-2015openalex-snapshot

The Application of the Self Organizing Map to the Vehicle Routing Problem

inferred← citeshttps://doi.org/10.3390/a11100143openalex-snapshot

An Algorithm for Mapping the Asymmetric Multiple Traveling Salesman Problem onto Colored Petri Nets

inferred← citeshttps://doi.org/10.3390/app132011406openalex-snapshot

Multi-Objective Optimization for High-Speed Railway Network Based on “Demand–Supply–Management” Model

inferred← citeshttps://doi.org/10.3390/drones9110762openalex-snapshot

Task Planning and Optimization for Multi-Region Multi-UAV Cooperative Inspection

inferred← citeshttps://doi.org/10.3390/math11133014openalex-snapshot

Compact Integer Programs for Depot-Free Multiple Traveling Salesperson Problems

inferred← citeshttps://doi.org/10.48550/arxiv.1803.09621openalex-snapshot

Learning the Multiple Traveling Salesmen Problem with Permutation Invariant Pooling Networks

inferred← citeshttps://doi.org/10.5772/12909openalex-snapshot

Traveling Salesman Problem: an Overview of Applications, Formulations, and Solution Approaches

inferred← citeshttps://doi.org/10.5772/547openalex-snapshot

Traveling Salesman Problem, Theory and Applications

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.