Back to Search

Journal article

On semidefinite programming relaxations of the traveling salesman problem

Actions

Email

Email this record

Send the bibliographic details of this record to your email address.

Your Email
Please enter the email address that the record information will be sent to.

-
Your message (optional)
Please add any additional information to be included within the email.
Cite

Cite this record

APA Style

Klerk, E., Pasechnik, D., & Sotirov, R. (2008). On semidefinite programming relaxations of the traveling salesman problem. SIAM Journal on Optimization, 19, 1559–1573.

MLA Style

Klerk, E., et al. “On Semidefinite Programming Relaxations of the Traveling Salesman Problem.” SIAM Journal on Optimization, vol. 19, 2008, pp. 1559–73.

Chicago Style

Klerk, E, D Pasechnik, and R Sotirov. 2008. “On Semidefinite Programming Relaxations of the Traveling Salesman Problem.” SIAM Journal on Optimization 19: 1559–73.
Tweet
Print

Authors

+ Klerk, E More by this author

Role:

Author

+ Pasechnik, D More by this author

Role:

Author

+ Sotirov, R More by this author

Role:

Author

Bibliographic Details

Journal:: SIAM Journal on Optimization
Volume:: 19
Pages:: 1559-1573
Publication date:: 2008-01-01

Item Description

UUID:: uuid:d11a9a11-3914-4960-9bc5-c8fe6eafd77d
Local pid:: cs:7265
Deposit date:: 2015-03-31

Terms of use

Copyright date:: 2008

Licence:: Terms and Conditions of Use for Oxford University Research Archive

Metrics

Views and Downloads

About views and downloads

If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP