One of the private line network design problems in the telecommunications industry is to interconnect a set of customer locations through a ring of end offices so as to minimize the total tariff cost and provide reliability. We develop a Tabu Search method for the problem that incorporates long...

The bandwidth packing (BWP) problem is a combinatorially difficult problem arising in the area of telecommunications. The problem consists of assigning calls to paths in a capacitated graph, such that capacities are not violated and the total profit is maximized. In this paper we discuss the...

This paper develops efficient algorithms for obtaining a dual feasible starting basis for the capacitated distribution problem. The motivation for the development of such a technique is threefold. Firstly, although efficient dual methods for solving such problems have been developed, none of...

A solution method is given for a class of practical optimization problems requiring the determination of a consistent partial ordering for sets of objects, events, preferences, and the like. These problems are characterized by the existence of "noisy" (or contradictory) links of varying...

This paper presents an in-depth computational comparison of the basic solution algorithms for solving transportation problems. The comparison is performed using "state of the art" computer codes for the dual simplex transportation method, the out-of-kilter method, and the primal simplex...

This paper gives efficient methods for solving four specially structured network problems that arise in connection with certain integer programming methods developed by Cook and Cooper, Hillier, and Glover. Such problems have also independently been studied in inventory theory by Ignall and...

A variety of combinatorial problems (e.g., in capital budgeting, scheduling, allocation) can be expressed as a linear integer programming problem. However, the standard devices for doing this often produce an inordinate number of variables and constraints, putting the problem beyond the...

A cardinality-constrained TSP (CC-TSP) problem requires the salesman to visit at least L and at most U cities, represented by nodes of a graph. The objective of this problem is to maximize the sum of weights of nodes visited. In this paper we propose a tabu search method based on ejection chain...

In the generation of an additional constraint or cut for integer programming introduced by Ralph Gomory, there is a certain parameter whose value is customarily chosen so that one of the original variables has a zero coefficient in the cut-equation. In this paper we consider alternative values...

This paper presents six new variants of the polynomially bounded Partitioning Shortest Path (PSP) algorithm for finding the shortest path from one node to all other nodes in a network. Three of these variants, one for negative arc lengths, but without negative cycles, and two for nonnegative arc...