We consider the Generalized Minimum Spanning Tree Problem denoted by GMSTP. It is known that GMSTP is NP-hard and even finding a near optimal solution is NP-hard. We introduce a new mixed integerâ€¦ (More)

The generalized traveling salesman problem (GTSP) is a generalization of the classical traveling salesman problem. The GTSP is known to be an NP-hard problem and has many interesting applications. Inâ€¦ (More)

Weconsider theRailwayTravelingSalesmanProblem (RTSP) in which a salesman using the railway network wishes to visit a certain number of cities to carry out his/her business, starting and ending at theâ€¦ (More)

Given a complete undirected graph with the nodes partitioned into m node sets called clusters, the Generalized Minimum Spanning Tree problem denoted by GMST is to find a minimum-cost tree whichâ€¦ (More)

The generalized vehicle routing problem (GVRP) is a natural extension of the classical vehicle routing problem (VRP). In GVRP, we are given a partition of the customers into groups (clusters) and aâ€¦ (More)

In this paper we present an effective metaheuristic algorithm based on ant colony system in the case of the dynamic generalized traveling salesman problem. The same technique can be used for otherâ€¦ (More)

In this survey paper, we discuss the development of the Generalized Minimum Spanning Tree Problem, denoted by GMSTP, and we focus on the integer programming formulations of the problem. The GMSTP isâ€¦ (More)

This paper addresses the problem of partitioning a set of vectors into two subsets such that the sums per every coordinate should be exactly or approximately equal. This problem, introduced by Kojicâ€¦ (More)