Analyse von Branch-and-Bound Algorithmen zum Problem des Handlungsreisenden

Schmitz, Christoph

Local TagsRelease HistoryDetailsSummary

Analyse von Branch-and-Bound Algorithmen zum Problem des Handlungsreisenden

Schmitz, C. (1995). Analyse von Branch-and-Bound Algorithmen zum Problem des Handlungsreisenden. Diploma Thesis, Universität des Saarlandes, Saarbrücken.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0027-F721-0 Version Permalink: https://hdl.handle.net/21.11116/0000-000E-5622-B

Genre: Thesis

Files

show Files

Locators

show

Creators

show

hide

Creators:
Schmitz, Christoph¹, Author
Mehlhorn, Kurt¹, Advisor
Hotz, Günter², Referee

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019
2External Organizations, ou_persistent22

Content

show

Details

show

hide

Language(s): eng - English

Dates: Submitted: 1995Accepted: 1995Date issued: 1995

Publication Status: Issued

Pages: 140

Publishing info: Saarbrücken : Universität des Saarlandes

Table of Contents: -

Rev. Type: -

Identifiers: BibTex Citekey: Schmitz95

Degree: Diploma

Event

show

Legal Case

show

Project information

show

Source

show