Extended counter-example for extended M.Diaby Linear Model
- From: "Radosław Hofman" <radekh@xxxxxxxxx>
- Date: Fri, 30 May 2008 12:48:10 +0200
Hi all,
After long time there it is: http://arxiv.org/abs/0805.4718
(Arxiv said: Abstract will appear in mailing scheduled to begin at 20:00
Sunday US Eastern time (i.e., Mon 2 Jun 08 00:00:00 GMT).
If you will have problem with accessing this document you may also retrieve
it from:
http://www.teycom.pl/docs/Report_on_article_The_Travelling_Salesman_Problem_A_Linear_Programming_Formulation.pdf
This counter example consists of 47 nodes, with detailed explanation:
- why it fits to model restrictions
- why it gives solution better then optimal TSP tour
This time I could not find way for direct computations (there are at least
10^9 variables using observation that we require only y's - see why in
article), but I hope that if one analyzes carefully this CE then he/she will
be able to understand why it fits in requirements.
I may not have time to give all answers in short time (I am very busy at
work nowadays) but it does not mean that I withdraw from discussion, so
please be patient if you ask me a question :-).
Best regards,
Radek Hofman
.
- Prev by Date: Re: How can I tell if F is a string or if it is a number?
- Previous by thread: New line to attack the P versus NP question
- Index(es):
Relevant Pages
|
