Pages that link to "Item:Q1822984"
From MaRDI portal
The following pages link to A neural network algorithm for the multiple traveling salesman problem (Q1822984):
Displaying 12 items.
- A deterministic annealing algorithm for approximating a solution of the min-bisection problem (Q280315) (← links)
- Stochastic methods for neural systems (Q1200640) (← links)
- Neural network methods in combinatorial optimization (Q1200816) (← links)
- Competition-based neural network for the multiple travelling salesmen problem with minmax objective (Q1302604) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- A deterministic annealing algorithm for the minimum concave cost network flow problem (Q1952548) (← links)
- Experimental study of a hybrid genetic algorithm for the multiple travelling salesman problem (Q2214785) (← links)
- An algorithm for mapping the asymmetric multiple traveling salesman problem onto colored Petri nets (Q2283818) (← links)
- ``Conscientious'' neural nets for tour construction in the traveling salesman problem: The vigilant net (Q2563885) (← links)
- Modeling and optimization of multiple traveling salesmen problems: an evolution strategy approach (Q2668611) (← links)
- A Lagrange multiplier and Hopfield-type barrier function method for the traveling salesman problem (Q2780855) (← links)
- An improved Hopfield Lagrange network with application on motor efficiency optimization (Q6578796) (← links)