On "P = NP: Linear Programming Formulation of the Traveling Salesman Problem": A reply to Hofman's Claim of a "Counter-Example"
<|reference_start|>On "P = NP: Linear Programming Formulation of the Traveling Salesman Problem": A reply to Hofman's Claim of a "Counter-Example": We show that Hofman's claim of a "counter-example" to Diaby's LP formulation of the TSP is invalid.<|reference_end|>
@article{diaby2006on,
    title={On "P = NP: Linear Programming Formulation of the Traveling Salesman
  Problem": A reply to Hofman's Claim of a "Counter-Example"},
    author={Moustapha Diaby},
    journal={arXiv preprint arXiv:cs/0611074},
    year={2006},
    archivePrefix={arXiv},
    eprint={cs/0611074},
    primaryClass={cs.CC cs.DM}
}