Monografie
Solving large-scale traveling salesman problems with parallel Branch-and-Cut
- Language
-
Englisch
- Identifier
-
1251949754
- Series
-
Angewandte Mathematik und Informatik, Universität zu Köln; Report No. 95.191
Contributor
Störmer, Peter
Jünger, Michael
Jünger, Michael
- URN
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
26.01.2023, 1:53 PM CET
Object type
- Monografie
Associated
- Störmer, Peter
- Jünger, Michael
Other Objects (12)
Provably good solutions for the traveling salesman problem
A parallel branch & cut algorithm for the solution of large-scale traveling Salesman problems
On Derandomized Approximation Algorithms
Integer Multicommodity Flows with Reduced Demands
Computational steering for collapse simulation of large scale complex structures
A fast 0(n) Embedding Algorithm, based on the Hopcroft-Tarjan Planary Test
The True Minimum Distance of Some Narrow-Sense BCH-Codes of Length 255
Block Sieving Algorithms
Image Retrieval on Large-Scale Image Databases
Fusing Local Image Descriptors for Large-Scale Image Retrieval
Structural Design and Analysis of Low-Density Parity-Check Codes and Systematic Repeat-Accumulate Codes
Nurbs-based elements as a basis for integrating engineering applications
Provably good solutions for the traveling salesman problem
A parallel branch & cut algorithm for the solution of large-scale traveling Salesman problems
On Derandomized Approximation Algorithms
Integer Multicommodity Flows with Reduced Demands
Computational steering for collapse simulation of large scale complex structures
A fast 0(n) Embedding Algorithm, based on the Hopcroft-Tarjan Planary Test
The True Minimum Distance of Some Narrow-Sense BCH-Codes of Length 255
Block Sieving Algorithms
Image Retrieval on Large-Scale Image Databases
Fusing Local Image Descriptors for Large-Scale Image Retrieval
Structural Design and Analysis of Low-Density Parity-Check Codes and Systematic Repeat-Accumulate Codes
Nurbs-based elements as a basis for integrating engineering applications
Provably good solutions for the traveling salesman problem
A parallel branch & cut algorithm for the solution of large-scale traveling Salesman problems
On Derandomized Approximation Algorithms
Integer Multicommodity Flows with Reduced Demands
Computational steering for collapse simulation of large scale complex structures
A fast 0(n) Embedding Algorithm, based on the Hopcroft-Tarjan Planary Test
The True Minimum Distance of Some Narrow-Sense BCH-Codes of Length 255
Block Sieving Algorithms
Image Retrieval on Large-Scale Image Databases
Fusing Local Image Descriptors for Large-Scale Image Retrieval
Structural Design and Analysis of Low-Density Parity-Check Codes and Systematic Repeat-Accumulate Codes