Global optimization for track finding

Diehl, Martin and Jünger, Michael and Frühwirth, R. and Scherzer, J. (1997) Global optimization for track finding.
Published in: Nucl. Instrum. & Mehods Phys. Res. Sect. A Vol. 389 (1-2). pp. 180-183.

Abstract

Hopfield networks with mean-field annealing have been proposed for track finding in particle detectors by Peterson and Denby. In this paper we investigate and compare some other-probabilistic and heuristic-approaches to finding the global minimum of the associated energy function: Simulated annealing, threshold accepting, great deluge, record-to-record travel, and tabu search. We also use a branch-and-bound and a branch-and-cut algorithm in order to obtain the exact global minimum.


Actions:
Full text not available from this repository.
Export as:
Editorial actions: View Item View Item (Login required)
Content information:
Item Type: Article
Citations: 4 (Google Scholar) | 3 (Web of Science)
Uncontrolled Keywords:
Subjects:
Divisions: Institute of Computer Science > Computer Science Department - Prof. Dr. Juenger
Related URLs:
Deposit Information:
ZAIK Number: zpr97-292
Depositing User: Prof. Dr. Michael Jünger
Date Deposited: 08 May 2003 00:00
Last Modified: 19 Jan 2012 09:22
URI: http://e-archive.informatik.uni-koeln.de/id/eprint/292