A Polyhedral Study of Quadratic Traveling Salesman Problems

to related objects

Location: Deutsche Nationalbibliothek Frankfurt am Main

Extent: Online-Ressource

Language: Englisch

Notes: Chemnitz, Technische Universität Chemnitz, Dissertation, 2013

Keyword: Optimierung
Polyeder
polyedrische Kombinatorik

Event: Veröffentlichung

(where): Chemnitz

(who): Universitätsbibliothek Chemnitz

(when): 2013

Creator: Fischer, Anja

Contributor: Helmberg, Christoph
Reinelt, Gerhard

URN: urn:nbn:de:bsz:ch1-qucosa-118345

Rights: Der Zugriff auf das Objekt ist unbeschränkt möglich.

Last update: 14.08.2025, 10:52 AM CEST

Data provider

This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.

Show original at data provider

Associated

Fischer, Anja
Helmberg, Christoph
Reinelt, Gerhard
Universitätsbibliothek Chemnitz

Time of origin

2013

Other Objects (12)

Polyhedral aspects of the traveling salesman problem, 1.. Theory

Polyhedral aspects of the traveling salesman problem, 2.. Computation

The traveling salesman problem

The Traveling Salesman Problem

Hochschulschrift

Das Traveling-Salesman-Problem, [1]

Approximation Algorithms for Traveling Salesman Problems

Hochschulschrift

Das Traveling Salesman Problem unter disjunktiven Zusatzrestriktionen

Approximation Algorithms for the Traveling Salesman Problem

On The Recoverable Robust Traveling Salesman Problem

Local elimination in the traveling salesman problem

Polyhedral aspects of the traveling salesman problem, 1.. Theory

Polyhedral aspects of the traveling salesman problem, 2.. Computation

The traveling salesman problem

The Traveling Salesman Problem

Hochschulschrift

Das Traveling-Salesman-Problem, [1]

Approximation Algorithms for Traveling Salesman Problems

Hochschulschrift

Das Traveling Salesman Problem unter disjunktiven Zusatzrestriktionen

Approximation Algorithms for the Traveling Salesman Problem

On The Recoverable Robust Traveling Salesman Problem

Local elimination in the traveling salesman problem

Polyhedral aspects of the traveling salesman problem, 1.. Theory

Polyhedral aspects of the traveling salesman problem, 2.. Computation

The traveling salesman problem

The Traveling Salesman Problem

Hochschulschrift

Das Traveling-Salesman-Problem, [1]

Approximation Algorithms for Traveling Salesman Problems

Hochschulschrift

Das Traveling Salesman Problem unter disjunktiven Zusatzrestriktionen

Approximation Algorithms for the Traveling Salesman Problem

On The Recoverable Robust Traveling Salesman Problem

Local elimination in the traveling salesman problem

Cultural heritage institutions wishing to register will find more information here.

Fields marked * need to be filled in.

Username*

Please enter your username

Email*

Please enter your email address

Please do not fill this field

First name

Last name

Password*

Please enter your password

Confirm password*

Please enter the same password

I have read the terms of use and the privacy policy for the collection of personal data and accept them. *

This field is required.

I would like to subscribe to the newsletter of the Deutsche Digitale Bibliothek. See newsletter subscription info.

Account created

Your "My DDB" account has been successfully created. Before you can log in to your account, you must click the confirmation link in the message we just sent to the email address you provided.

A Polyhedral Study of Quadratic Traveling Salesman Problems

Object Details

Classification and Topics

Contributors, Places and Time

Further information

Data provider

Associated

Time of origin

Other Objects (12)

Polyhedral aspects of the traveling salesman problem, 1.. Theory

Polyhedral aspects of the traveling salesman problem, 1.. Theory

Polyhedral aspects of the traveling salesman problem, 2.. Computation

Polyhedral aspects of the traveling salesman problem, 2.. Computation

The traveling salesman problem

The Traveling Salesman Problem

Das Traveling-Salesman-Problem, [1]

Approximation Algorithms for Traveling Salesman Problems

Das Traveling Salesman Problem unter disjunktiven Zusatzrestriktionen

Approximation Algorithms for the Traveling Salesman Problem

On The Recoverable Robust Traveling Salesman Problem

Local elimination in the traveling salesman problem

Polyhedral aspects of the traveling salesman problem, 1.. Theory

Polyhedral aspects of the traveling salesman problem, 1.. Theory

Polyhedral aspects of the traveling salesman problem, 2.. Computation

Polyhedral aspects of the traveling salesman problem, 2.. Computation

The traveling salesman problem

The Traveling Salesman Problem

Das Traveling-Salesman-Problem, [1]

Approximation Algorithms for Traveling Salesman Problems

Das Traveling Salesman Problem unter disjunktiven Zusatzrestriktionen

Approximation Algorithms for the Traveling Salesman Problem

On The Recoverable Robust Traveling Salesman Problem

Local elimination in the traveling salesman problem

Polyhedral aspects of the traveling salesman problem, 1.. Theory

Polyhedral aspects of the traveling salesman problem, 1.. Theory

Polyhedral aspects of the traveling salesman problem, 2.. Computation

Polyhedral aspects of the traveling salesman problem, 2.. Computation

The traveling salesman problem

The Traveling Salesman Problem

Das Traveling-Salesman-Problem, [1]

Approximation Algorithms for Traveling Salesman Problems

Das Traveling Salesman Problem unter disjunktiven Zusatzrestriktionen

Approximation Algorithms for the Traveling Salesman Problem

On The Recoverable Robust Traveling Salesman Problem

Local elimination in the traveling salesman problem

Related objects

Reset password