Avancerad sökning

Hittade 1 uppsats som matchar ovanstående sökkriterier.

1. 1. The Asymmetric Travelling Salesman Problem : A Linear Programming Solution Approach

   Kandidat-uppsats, KTH/Skolan för datavetenskap och kommunikation (CSC)

   Författare :SOHOF DASTMARD; [2014]
   Nyckelord :;

   Sammanfattning : The travelling salesman problem is a well known optimization problem. The goal is to nd theshortest tour that visits each city in a given list exactly once. Despite the simple problem statementit belongs to the class of NP-complete problems. Its importance arises from a plethora of applicationsas well as a theoretical appeal. LÄS MER