2-Opt Optimization for the Travelling Salesman Problem
Given a complete graph with weighted edges representing cities and distances, explain how the 2-opt improvement technique can be used to iteratively improve an initial travelling salesman tour. Describe how a 2-opt swap modifies the tour and state the criterion for accepting the new tour.
Eulerian Trail in Directed Graphs: In-Out Degree Analysis and Path Construction
Consider a directed graph represented by the following description: The graph has vertices {A, B, C, D} and directed edges given by A→B, B→C, C→A, C→D, and D→B. Part (a) requires you to calculate the in-degree and out-degree for each vertex and determine if the graph satisfies the necessary conditions for the existence of an […]