Many optimization problems of practical interest are computationally intractable. Therefore, a practical approach for solving such problems is to employ heuristic (approximation) algorithms that canâ€¦ (More)

The quadratic minimum spanning tree problem and its variations such as the quadratic bottleneck spanning tree problem, the minimum spanning tree problem with conflict pair constraints, and theâ€¦ (More)

In this work we address the Quadratic Minimum Spanning Tree Problem (QMSTP) known to be NP-hard. Given a complete graph, the QMSTP consists of determining a minimum spanning tree (MST) consideringâ€¦ (More)

We show that the 2-Opt and 3-Opt heuristics for the traveling salesman problem (TSP) on the complete graph Kn produce a solution no worse than the average cost of a tour in Kn in a polynomial numberâ€¦ (More)

Neighborhood search algorithms are often the most effective approaches available for solving partitioning problems, a difficult class of combinatorial optimization problems arising in manyâ€¦ (More)