Hi, I am trying to find a copy of Eastman's Harvard thesis(1958) Linear Programming with Pattern Constraints. Supposedly it was a seminal paper since it solved the TSP problem by combining branch and bound with a Hungarian algorithm optimization. Curiously, it is cited often but I cannot find it being published.

If you know of a way I can get a copy, please leave a note on the or-exchange. Thank you.

Laurence

asked 23 Aug '11, 19:04

L.%20T.'s gravatar image

L. T.
213
accept rate: 0%

retagged 05 Dec '11, 14:58

fbahr's gravatar image

fbahr ♦
4.6k717


It's possible that it's not available online. There should be a copy in the Harvard library, and you can probably request it.

link

answered 23 Aug '11, 19:08

DC%20Woods's gravatar image

DC Woods ♦
4.1k22546
accept rate: 5%

OCLC WorldCat Dissertations or ProQuest Dissertations & Theses Database would be places one could check [for an online copy] - ...of course, only if enrolled at a high-profile university (preferably Harvard, in this case).

(24 Aug '11, 15:14) fbahr ♦
Your answer
toggle preview

Follow this question

By Email:

Once you sign in you will be able to subscribe for any updates here

By RSS:

Answers

Answers and Comments

Markdown Basics

  • *italic* or _italic_
  • **bold** or __bold__
  • link:[text](http://url.com/ "Title")
  • image?![alt text](/path/img.jpg "Title")
  • numbered list: 1. Foo 2. Bar
  • to add a line break simply add two spaces to where you would like the new line to be.
  • basic HTML tags are also supported

Tags:

×26
×14
×5

Asked: 23 Aug '11, 19:04

Seen: 1,755 times

Last updated: 05 Dec '11, 14:58

OR-Exchange! Your site for questions, answers, and announcements about operations research.