Operations Research at Bell Laboratories through the 1970s: Part II

References

  • Abrams B. S., Hirsh R. B. Computer aids for rural route planning. Bell Labs. Record (1974) 52:259–264Google Scholar
  • Amory R. W. Engineering outside plant with computers. Bell Labs. Record (1963) 41:258–266Google Scholar
  • Amory R. W., Trachy R. A. Computer techniques applied to exchange outside plant engineering. IEEE Trans. Commun. Electr. (1964) 83:46–54CrossrefGoogle Scholar
  • Archer N. P. A maintenance inventory control system for high cost items. APICS Internat. Tech. Conf. Proc. (1973) 1–11Google Scholar
  • Avi-Itzhak B., Heyman D. P. Approximate queuing models for multiprogramming computer systems. Oper. Res. (1973) 21:1212–1230LinkGoogle Scholar
  • Bergholm J. O., Koliss P. P. Serving area concept—a plan for now with look to the future. Bell Labs. Record (1972) 50:212–216Google Scholar
  • Boesch F. T., Felzer A. P. A general class of invulnerable graphs. Networks (1972) 2:261–283CrossrefGoogle Scholar
  • Boyer P. J., Cautin H., Dolcourt V. E. Planning central office growth. Bell Labs. Record (1976) 54:189–192Google Scholar
  • Chang R. C. Managing inventories of low-volume station products: the computer approach. Bell Labs. Record (1977) 55:180–186Google Scholar
  • Chen S., McCallum C. J. The application of management science to the design of telephone directories. Interfaces (1977) 8:58–69LinkGoogle Scholar
  • Chen S., Saigal R. A primal algorithm for solving a capacitated network flow problem with additional linear constraints. Networks (1977) 7:59–79CrossrefGoogle Scholar
  • Dawson C. S., McCallum C. J., Murphy R. B., Wolman E. Operations research at Bell Laboratories through the 1970s, Part I. Oper. Res. (2000) 48(2):204–215LinkGoogle Scholar
  • Edwards H. S., Hardaway H. Z. New concepts in exchange outside plant engineering. Bell System Tech. J. (1965) 44:373–399CrossrefGoogle Scholar
  • Freidenfelds J., McLaughlin C. D. A heuristic branchand-bound research algorithm for telephone feeder capacity expansion. Oper. Res. (1979) 27:567–582LinkGoogle Scholar
  • Gillette D. Innovations in the exchange area. Bell Labs. Record (1975) 53:360–367Google Scholar
  • Gimpelson L. A. Computer programs for exchange engineering. Bell Labs. Record (1966) 44:118–123Google Scholar
  • Gresh P. A. Dedicated outside plant. Bell Labs. Record (1965) 43:26–29Google Scholar
  • Gresh P. A. Physical and transmission characteristics of the customer loop plant. Bell System Tech. J. (1969) 48:3337–3385CrossrefGoogle Scholar
  • Halfin S. An optimization method for cascaded filters. Bell System Tech. J. (1970a) 49:185–190CrossrefGoogle Scholar
  • Halfin S. Simultaneous determination of ordering and amplifications of cascaded subsystems. J. Optim. Theory Appl. (1970b) 6:356–363CrossrefGoogle Scholar
  • Halfin S. Arbitrarily complex corner polyhedra are dense in Rn. SIAM J. Appl. Math. (1972a) 23:157–163CrossrefGoogle Scholar
  • Halfin S. Steady-state distribution for the buffer content of an M/G/1 queue with varying service rate. SIAM J. Appl. Math. (1972b) 23:356–363CrossrefGoogle Scholar
  • Halfin S. An approximate method for calculating delays for a family of cyclic-type queues. Bell System Tech. J. (1975a) 54:1733–1754CrossrefGoogle Scholar
  • Halfin S. Explicit construction of invariant measures for a class of continuous state Markov processes. Ann. Probab. (1975b) 3:859–864CrossrefGoogle Scholar
  • Halfin S., McCallum C. J., Segal M. Modeling the growth of jumpers on the main distributing frame. Bell System Tech. J. (1972) 51:1517–1534CrossrefGoogle Scholar
  • Halfin S., Segal M. A priority queuing model for a mixture of two types of customers. SIAM J. Appl. Math. (1972) 23:369–379CrossrefGoogle Scholar
  • Handler G. J. Mathematical methods for the design of telephone directory content and distribution. Computers and Oper. Res. (1974) 1:31–38CrossrefGoogle Scholar
  • Hardaway H. Z. Computers and the exchange plant. Bell Labs. Record (1972) 50:36–43Google Scholar
  • Hardgrave W. W. Coin telephone collection operations. Bell Labs. Record (1966) 44:358–363Google Scholar
  • Heyman D. P. Optimal operating policies for M/G/1 queuing systems. Oper. Res. (1968) 16:362–382LinkGoogle Scholar
  • Heyman D. P. An approximation for the busy period of the M/G/1 queue using a diffusion model. J. Appl. Probab. (1974) 11:159–169CrossrefGoogle Scholar
  • Heyman D. P. A diffusion model approximation for the GI/G/1 queue in heavy traffic. Bell System Tech. J. (1975) 54:1637–1646CrossrefGoogle Scholar
  • Heyman D. P. Optimal disposal policies for a single-item inventory system with returns. Naval Res. Logist. Quart. (1977a) 24:385–405CrossrefGoogle Scholar
  • Heyman D. P. The T-policy for the M/G/1 queue. Management Sci. (1977b) 23:775–778LinkGoogle Scholar
  • Heyman D. P. Return policies for an inventory system with positive and negative demands. Naval Res. Logist. Quart. (1978) 25:581–596CrossrefGoogle Scholar
  • Heyman D. P., Marshall K. T. Bounds on the optimal operating policy for a class of single-server queues. Oper. Res. (1968) 16:1138–1146LinkGoogle Scholar
  • Heyman D. P., Segal M. Conditional delays measured in events for the M/M/c queue. Oper. Res. (1974) 22:575–581LinkGoogle Scholar
  • Hinderliter R. G. Transmission characteristics of Bell System subscriber loop plant. IEEE Trans. Commun. Electr. (1963) 82:464–470CrossrefGoogle Scholar
  • Hoadley A. B., Heyman D. P. A two-echelon inventory model with purchases, dispositions, shipments, returns, and transshipments. Naval Res. Logist. Quart. (1977) 24:1–19CrossrefGoogle Scholar
  • Hortberg D. R. Keeping track of cable maintenance. Bell Labs. Record (1970) 48:40–45Google Scholar
  • Kennedy R. B.Inventory Management Principles: A Non-Technical Explanation (1978) (American Telephone & Telegraph Company, New York) Google Scholar
  • Kochman G. A., Libenschek R. S., McCallum C. J. A ‘model’ way to plan the transatlantic network. Bell Labs. Record (1982) 60:143–147Google Scholar
  • Kochman G. A., McCallum C. J. Facility location models for planning a transatlantic communications network. Euro. J. Oper. Res. (1981) 6:205–211CrossrefGoogle Scholar
  • Koontz W. L. G. Optimal temporary deferral of reinforcements in a single terminal flow network. IEEE Trans. Systems Man Cybern. (1974) 4:307–309CrossrefGoogle Scholar
  • Luss H. A model for advanced reservations for intercity visual conferencing services. Operational Res. Quart. (1977) 28:275–284CrossrefGoogle Scholar
  • Marshall K. T., Suurballe J. W. A note on cycling in the simplex method. Naval Res. Logist. Quart. (1969) 16:121–137CrossrefGoogle Scholar
  • McCallum C. J. A generalized upper bounding approach to a communications network flow problem. Networks (1977) 7:1–23CrossrefGoogle Scholar
  • Pamm L. R. Unigauge—a new subscriber loop system. Bell Labs. Record (1967) 45:261–264Google Scholar
  • Rath J. H., Sheng D. D. Approximations for overflows from queues with a finite waiting room. Oper. Res. (1979) 27:1208–1216LinkGoogle Scholar
  • Segal M. Traffic engineering of communications networks with a general class of routing schemes. Proc. Fourth Internat. Teletraffic Congress (1964) LondonGoogle Scholar
  • Segal M. A multiserver system with preemptive priorities. Oper. Res. (1970a) 18:316–323LinkGoogle Scholar
  • Segal M. A multiserver system with a finite number of sources and delayed requests served at random. Proc. Sixth Internat. Teletraffic Congress (1970b) MunichGoogle Scholar
  • Segal M. The operator-scheduling problem: a network-flow approach. Oper. Res. (1974) 22:808–823LinkGoogle Scholar
  • Segal M., Weinberger D. B. Turfing. Oper. Res. (1977) 25:367–386LinkGoogle Scholar
  • Showers J. L. An inventory management simulation game. Proc. Winter Simulation Conf. (1977) 278–284Google Scholar
  • Showers J. L., Chakrin L. M. Reducing uncollectible revenue from residential telephone customers. Interfaces (1981) 11:21–31LinkGoogle Scholar
  • Suurballe J. W. Disjoint paths in a network. Networks (1974) 4:125–145CrossrefGoogle Scholar
  • Thomas R. E. On optimum path problems. Networks (1976) 6:287–305CrossrefGoogle Scholar
  • Watson G. F. Bell System motor vehicles: moving with the times. Bell Labs. Record (1976) 54:54–59Google Scholar
  • Wilson R. H., Mueller W. A. A new method of stock control. Harvard Bus. Rev. (1927) 5:197–205Google Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.