التفاصيل البيبلوغرافية
| العنوان: |
Provably good solutions for the traveling salesman problem |
| المؤلفون: |
Michael Jünger, Michael Junger, Gerhard Reinelt, Stefan Thienel |
| المساهمون: |
The Pennsylvania State University CiteSeerX Archives |
| المصدر: |
ftp://ftp.mi.uni-koeln.de/pub/paper/zpr92-114.ps.gz |
| سنة النشر: |
1992 |
| المجموعة: |
CiteSeerX |
| الوصف: |
The determination of true optimum solutions of combinatorial optimization problems is seldomly required in practical applications. The majority of users of optimization software would be satisfied with solutions of guaranteed quality in the sense that it can be proven that the given solution is at most a few percent off an optimum solution. This paper presents a general framework for practical problem solving with emphasis on this aspect. A detailed discussion along with a report about extensive computational experiments is given for the traveling salesman problem. Recent research in algorithm design for hard combinatorial optimization problems follows two trends. One aims at a continuously better understanding of structural properties of a given problem in the pursuit of solving larger instances to optimality. For a few prominent hard combinatorial optimization problems such as the traveling salesman problem (TSP), the linear ordering problem or the max-cut problem, branch & cut alg. |
| نوع الوثيقة: |
text |
| وصف الملف: |
application/postscript |
| اللغة: |
English |
| Relation: |
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.45.6985 |
| الاتاحة: |
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.45.6985 |
| Rights: |
Metadata may be used without restrictions as long as the oai identifier remains attached to it. |
| رقم الانضمام: |
edsbas.18047C84 |
| قاعدة البيانات: |
BASE |