Monografie
A parallel branch & cut algorithm for the solution of large-scale traveling Salesman problems
- Ausgabe
-
Als Ms. gedr.
- Sprache
-
Englisch
- Umfang
-
V, 152 S.
- Anmerkungen
-
Zugl.: Köln, Univ., Diss., 1998
- ISBN
-
978-3-8265-4016-5
- Identifier
-
954095553
- Reihe
-
Berichte aus der Informatik
Thema
Travelling-salesman-Problem ; Branch-and-Cut-Methode ; Paralleler Algorithmus ; Hochschulschrift
Beteiligte Personen und Organisationen
- Inhaltsverzeichnis
- Rechteinformation
-
Der Zugriff auf Teile des Objekts ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.04.2024, 08:51 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- Monografie
Beteiligte
Ähnliche Objekte (12)
Solving large-scale traveling salesman problems with parallel Branch-and-Cut
Initialization of parallel branch-and-bound algorithms
A Distributed Algorithm for Large-Scale Generalized Matching
A parallel Lanczos algorithm for eigensystem calculation
GeneTS: a relational functional genetic algorithm for the traveling salesman problem
Traveling Companions
A scalable parallel sorting algorithm using exact splitting
Efficient parallel algorithms for large-scale pedestrian simulation
A branch-and-bound based algorithm for nonconvex multiobjective optimization
LaGO - a (heuristic) Branch and Cut algorithm fornonconvex MINLPs
Local load balancing for data parallel branch-and-bound
Traveling in France
Solving large-scale traveling salesman problems with parallel Branch-and-Cut
Initialization of parallel branch-and-bound algorithms
A Distributed Algorithm for Large-Scale Generalized Matching
A parallel Lanczos algorithm for eigensystem calculation
GeneTS: a relational functional genetic algorithm for the traveling salesman problem
Traveling Companions
A scalable parallel sorting algorithm using exact splitting
Efficient parallel algorithms for large-scale pedestrian simulation
A branch-and-bound based algorithm for nonconvex multiobjective optimization
LaGO - a (heuristic) Branch and Cut algorithm fornonconvex MINLPs
Local load balancing for data parallel branch-and-bound
Traveling in France
Solving large-scale traveling salesman problems with parallel Branch-and-Cut
Initialization of parallel branch-and-bound algorithms
A Distributed Algorithm for Large-Scale Generalized Matching
A parallel Lanczos algorithm for eigensystem calculation
GeneTS: a relational functional genetic algorithm for the traveling salesman problem
Traveling Companions
A scalable parallel sorting algorithm using exact splitting
Efficient parallel algorithms for large-scale pedestrian simulation
A branch-and-bound based algorithm for nonconvex multiobjective optimization
LaGO - a (heuristic) Branch and Cut algorithm fornonconvex MINLPs
Local load balancing for data parallel branch-and-bound