139 related articles for article (PubMed ID: 31167309)
1. Constrained Nets for Graph Matching and Other Quadratic Assignment Problems.
Simić PD
Neural Comput; 1991; 3(2):268-281. PubMed ID: 31167309
[TBL] [Abstract][Full Text] [Related]
2. The generalized quadratic knapsack problem. A neuronal network approach.
Talaván PM; Yáñez J
Neural Netw; 2006 May; 19(4):416-28. PubMed ID: 16488117
[TBL] [Abstract][Full Text] [Related]
3. Learning graph matching.
Caetano TS; McAuley JJ; Cheng L; Le QV; Smola AJ
IEEE Trans Pattern Anal Mach Intell; 2009 Jun; 31(6):1048-58. PubMed ID: 19372609
[TBL] [Abstract][Full Text] [Related]
4. A self-organizing neural network for the traveling salesman problem that is competitive with simulated annealing.
Budinich M
Neural Comput; 1996 Feb; 8(2):416-24. PubMed ID: 8581888
[TBL] [Abstract][Full Text] [Related]
5. Fast approximate quadratic programming for graph matching.
Vogelstein JT; Conroy JM; Lyzinski V; Podrazik LJ; Kratzer SG; Harley ET; Fishkind DE; Vogelstein RJ; Priebe CE
PLoS One; 2015; 10(4):e0121002. PubMed ID: 25886624
[TBL] [Abstract][Full Text] [Related]
6. Parameter Sensitivity of the Elastic Net Approach to the Traveling Salesman Problem.
Simmen MW
Neural Comput; 1991; 3(3):363-374. PubMed ID: 31167320
[TBL] [Abstract][Full Text] [Related]
7. Factorized Graph Matching.
Zhou F; de la Torre F
IEEE Trans Pattern Anal Mach Intell; 2016 Sep; 38(9):1774-1789. PubMed ID: 26595909
[TBL] [Abstract][Full Text] [Related]
8. Approximate Graph Edit Distance in Quadratic Time.
Riesen K; Ferrer M; Bunke H
IEEE/ACM Trans Comput Biol Bioinform; 2020; 17(2):483-494. PubMed ID: 26390496
[TBL] [Abstract][Full Text] [Related]
9. Convergence properties of the softassign quadratic assignment algorithm.
Rangarajan A; Vuille A; Mjolsness E
Neural Comput; 1999 Aug; 11(6):1455-74. PubMed ID: 10423503
[TBL] [Abstract][Full Text] [Related]
10. Research on a hybrid neural network task assignment algorithm for solving multi-constraint heterogeneous autonomous underwater robot swarms.
Ru J; Hao D; Zhang X; Xu H; Jia Z
Front Neurorobot; 2022; 16():1055056. PubMed ID: 36704716
[TBL] [Abstract][Full Text] [Related]
11. A neural network approach to job-shop scheduling.
Zhou DN; Cherkassky V; Baldwin TR; Olson DE
IEEE Trans Neural Netw; 1991; 2(1):175-9. PubMed ID: 18276371
[TBL] [Abstract][Full Text] [Related]
12. The elastic net algorithm and protein structure prediction.
Ball KD; Erman B; Dill KA
J Comput Chem; 2002 Jan; 23(1):77-83. PubMed ID: 11913391
[TBL] [Abstract][Full Text] [Related]
13. A Functional Representation for Graph Matching.
Wang FD; Xue N; Zhang Y; Xia GS; Pelillo M
IEEE Trans Pattern Anal Mach Intell; 2020 Nov; 42(11):2737-2754. PubMed ID: 31144627
[TBL] [Abstract][Full Text] [Related]
14. Neural Graph Matching Network: Learning Lawler's Quadratic Assignment Problem With Extension to Hypergraph and Multiple-Graph Matching.
Wang R; Yan J; Yang X
IEEE Trans Pattern Anal Mach Intell; 2022 Sep; 44(9):5261-5279. PubMed ID: 33961550
[TBL] [Abstract][Full Text] [Related]
15. Efficient convex-elastic net algorithm to solve the Euclidean traveling salesman problem.
Al-Mulhem M; Al-Maghrabi T
IEEE Trans Syst Man Cybern B Cybern; 1998; 28(4):618-20. PubMed ID: 18255981
[TBL] [Abstract][Full Text] [Related]
16. A semi-localized elastic net for surface reconstruction of objects from multislice images.
Damper RI; Gilson SJ; Middleton I
Int J Neural Syst; 2002 Apr; 12(2):95-108. PubMed ID: 12035124
[TBL] [Abstract][Full Text] [Related]
17. New aspects of the elastic net algorithm for cluster analysis.
Lévano M; Nowak H
Neural Comput Appl; 2011 Sep; 20(6):835-850. PubMed ID: 21949468
[TBL] [Abstract][Full Text] [Related]
18. Solving the Min-Max Clustered Traveling Salesmen Problem Based on Genetic Algorithm.
Bao X; Wang G; Xu L; Wang Z
Biomimetics (Basel); 2023 Jun; 8(2):. PubMed ID: 37366833
[TBL] [Abstract][Full Text] [Related]
19. Analog "neuronal" networks in early vision.
Koch C; Marroquin J; Yuille A
Proc Natl Acad Sci U S A; 1986 Jun; 83(12):4263-7. PubMed ID: 3459172
[TBL] [Abstract][Full Text] [Related]
20. An efficient self-organizing map designed by genetic algorithms for the traveling salesman problem.
Jin HD; Leung KS; Wong ML; Xu ZB
IEEE Trans Syst Man Cybern B Cybern; 2003; 33(6):877-88. PubMed ID: 18238240
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
