2-Matchings, the Traveling Salesman Problem, and the Subtour LP: A Proof of the Boyd-Carr Conjecture.

Saved in:
Bibliographic Details
Title: 2-Matchings, the Traveling Salesman Problem, and the Subtour LP: A Proof of the Boyd-Carr Conjecture.
Authors: Schalekamp, Frans1 frans@wm.edu.fransschalekamp.com, Williamson, David P.2 dpw@cs.cornell.edu, van Zuylen, Anke1 anke@wm.edu.ankevanzuylen.com
Source: Mathematics of Operations Research (INFORMS). May2014, Vol. 39 Issue 2, p403-417. 15p.
Database: Business Source Ultimate
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: bsu
DbLabel: Business Source Ultimate
An: 99425825
AccessLevel: 2
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: 2-Matchings, the Traveling Salesman Problem, and the Subtour LP: A Proof of the Boyd-Carr Conjecture.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Schalekamp%2C+Frans%22">Schalekamp, Frans</searchLink><relatesTo>1</relatesTo><i> frans@wm.edu.fransschalekamp.com</i><br /><searchLink fieldCode="AR" term="%22Williamson%2C+David+P%2E%22">Williamson, David P.</searchLink><relatesTo>2</relatesTo><i> dpw@cs.cornell.edu</i><br /><searchLink fieldCode="AR" term="%22van+Zuylen%2C+Anke%22">van Zuylen, Anke</searchLink><relatesTo>1</relatesTo><i> anke@wm.edu.ankevanzuylen.com</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Mathematics+of+Operations+Research+%28INFORMS%29%22">Mathematics of Operations Research (INFORMS)</searchLink>. May2014, Vol. 39 Issue 2, p403-417. 15p.
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=bsu&AN=99425825
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1287/moor.2013.0608
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 15
        StartPage: 403
    Titles:
      – TitleFull: 2-Matchings, the Traveling Salesman Problem, and the Subtour LP: A Proof of the Boyd-Carr Conjecture.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Schalekamp, Frans
      – PersonEntity:
          Name:
            NameFull: Williamson, David P.
      – PersonEntity:
          Name:
            NameFull: van Zuylen, Anke
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 05
              Text: May2014
              Type: published
              Y: 2014
          Identifiers:
            – Type: issn-print
              Value: 0364765X
          Numbering:
            – Type: volume
              Value: 39
            – Type: issue
              Value: 2
          Titles:
            – TitleFull: Mathematics of Operations Research (INFORMS)
              Type: main
ResultId 1