@article{jackson_rouskas_stallmann_2007, title={The directional p-median problem: Definition, complexity, and algorithms}, volume={179}, ISSN={["0377-2217"]}, DOI={10.1016/j.ejor.2005.06.080}, abstractNote={An instance of a p-median problem gives n demand points. The objective is to locate p supply points in order to minimize the total distance of the demand points to their nearest supply point. p-Median is polynomially solvable in one dimension but NP-hard in two or more dimensions, when either the Euclidean or the rectilinear distance measure is used. In this paper, we treat the p-median problem under a new distance measure, the directional rectilinear distance, which requires the assigned supply point for a given demand point to lie above and to the right of it. In a previous work, we showed that the directional p-median problem is polynomially solvable in one dimension; we give here an improved solution through reformulating the problem as a special case of the constrained shortest path problem. We have previously proven that the problem is NP-complete in two or more dimensions; we present here an efficient heuristic to solve it. Compared to the robust Teitz and Bart heuristic, our heuristic enjoys substantial speedup while sacrificing little in terms of solution quality, making it an ideal choice for real-world applications with thousands of demand points.}, number={3}, journal={EUROPEAN JOURNAL OF OPERATIONAL RESEARCH}, author={Jackson, Laura E. and Rouskas, George N. and Stallmann, Matthias F. M.}, year={2007}, month={Jun}, pages={1097–1108} }
 @inbook{xin_baldine_cassada_stevenson_jackson_perros_2004, title={ORBIS: A reconfigurable hybrid optical metropolitan area network architecture}, volume={3042}, ISBN={3540219595}, DOI={10.1007/978-3-540-24693-0_142}, abstractNote={In this paper, we propose a novel metropolitan area network (MAN) ring architecture, ORBIS, a multiple-service WDM platform that supports multiple transport techniques. The WDM ring is horizontally divided into multiple subnetworks, each of which supports one type of the traffic with a subset of the total wavelengths. The system and subnetwork control mechanism and reconfiguration issues are addressed in this paper.}, booktitle={Networking 2004: Networking technologies, services, and protocols: Performance of computer and communication networks, mobile and wireless commuication: Third International IFIP-TC6 Networking Conference, Athens, Greece, May 9-14, 2004 ; Proceedings}, publisher={Berlin; New York: Springer}, author={Xin, Y. F. and Baldine, I. and Cassada, M. and Stevenson, D. and Jackson, L. E. and Perros, H.}, year={2004}, pages={1502–1507} }
 @article{jackson_rouskas_2002, title={Deterministic preemptive scheduling of real-time tasks}, volume={35}, ISSN={["1558-0814"]}, DOI={10.1109/MC.2002.999778}, abstractNote={Algorithms for the preemptive scheduling of deterministic, real-time tasks can have applications in providing quality-of-service guarantees to packet flows in multichannel optical networks.}, number={5}, journal={COMPUTER}, author={Jackson, LE and Rouskas, GN}, year={2002}, month={May}, pages={72-+} }