This paper reviews some recent contributions by the authors and their associates and
highlights a few innovative ideas, which led them to address some hard combinatorial …

This book presents the state-of-the-art methods in Linear Integer Programming, including
some new algorithms and heuristic methods developed by the authors in recent years …

This paper presents a heuristic to find the travelling salesman tour (TST) in a connected
network. The approach first identifies a node and two associated arcs that are desirable for …

In graph theory, a well-known problem is to find the minimum salesman tour ie, to find a way
of moving from a given origin node and returning back to the same node after visiting each …

Usually, analysis of a directed network with respect to a particular problem is
computationally less demanding when compared to a similar situation analysed for the non …

Numerous problems in science and engineering involve linear partial differential equations
and integro-differential equations. Examples are diverse, including vibration of flexible …

This chapter investigates a link-weight modification philosophy for solving network
optimization problems. Many network problems which have been analyzed and solved by …