Learn More
This paper proposes a new formulation for the bandwidth packing problem, assuring maximum service delay in telecommunications networks. The bandwidth packing problem is one of selecting calls, from a list of requests, to be routed in the network. We limit the maximum queueing delay, while maximizing revenues generated from the routed calls. An efficient(More)
In this paper we propose a new formulation for the bandwidth packing problem (BWP) in telecommunications networks. This problem is one of selecting calls, from a list of requests, to be routed in the telecommunications network. We consider both revenue losses and costs associated with communications delay as parts of the objective. An ecient Lagrangean(More)
cles and reviews published herein reflect the opinion of the author(s); inclusion of articles and advertisements does not necessarily constitute endorsement or sanction by the editors or by SPIE/Kluwer Academic Publishers. COPYRIGHT AND REPRINT PERMISSIONS: Abstracting is permitted with credit to the source. Photocopying of those articles that carry a code(More)
In this paper we propose a hybrid memory adaptive heuristic for solving the Capacitated Minimum Spanning Tree (CMST) problem. We augment the problem formulation with additional non-redundant constraints via use of adaptive memory, to improve upon the performance of an elementary heuristic (the Esau-Williams heuristic). Our methodology is tested against many(More)
We study a make-to-order manufacturing system consisting of several processing centers that are subject to failures and repairs. Our objective is to build a model that can be used as a tool for negotiating the delivery date and the price of a certain upcoming order. The model takes into account the congestion level of the shop floor at the time the order is(More)
Sentiment analysis or opinion mining is the field of computational study of people's opinion expressed in written language or text. Sentiment analysis brings together various research areas such as natural language processing, data mining and text mining, and is fast becoming of major importance to organizations as they integrate online commerce into their(More)
It is the purpose of this paper to investigate effects of adding ran-domization to a memory-based heuristic. The algorithms we propose are applied to the Capacitated Minimum Spanning Tree problem (CMST), and we study the combined effects of simultaneously applying a memory-based and a random-based heuristic to the CMST. This paper uses the Adaptive(More)
Reverse distribution, or the management of product return flows, induced by various forms of reuse of products and materials, has received growing attention throughout this decade. In this paper we discuss reverse distribution, and propose a mathematical programming model for a version of this problem. Due to the complexity of the proposed model, we(More)
In this paper we describe a visual interactive decision support tool 'VisOpt' which is designed to solve P-median problems with capacity constraints. Various design features incorporated in VisOpt are also presented and analyzed. We also present a demonstration of the use of VisOpt by a number of human subjects for various problem instances. The quality of(More)