Groups | Search | Server Info | Login | Register
Groups > sci.math.num-analysis > #34053
| Newsgroups | sci.math.num-analysis |
|---|---|
| Date | 2023-06-19 18:51 -0700 |
| References | <8i6ajm$lil$1@slb2.atl.mindspring.net>#1/1> |
| Message-ID | <b9cfff13-5ac8-4b5f-991b-460d05ee9d8dn@googlegroups.com> (permalink) |
| Subject | Re: Traveling salesman problem? |
| From | V õ l u r <nooneyenoneyouareright@mail.ee> |
Why does the salesman have to travel, when he can sell everything from home ? On Tuesday, June 13, 2000 at 9:00:00 AM UTC+2, CJB wrote: > Does anyone know if the classical "traveling salesmen" problem was ever > solved or proven? (A traveling salesmen must visit each city exactly once - > what is the shortest route to do so, and how do you prove it?) > Chris
Back to sci.math.num-analysis | Previous | Next | Find similar
Re: Traveling salesman problem? V õ l u r <nooneyenoneyouareright@mail.ee> - 2023-06-19 18:51 -0700
csiph-web