Back Matter

Back MatterSource: Operations Research, Vol. 47, No. 1 (Jan. - Feb., 1999), pp. 171-173Published by: INFORMSStable URL: http://www.jstor.org/stable/222904 .

Accessed: 08/05/2014 18:06

Your use of the JSTOR archive indicates your acceptance of the Terms & Conditions of Use, available at .http://www.jstor.org/page/info/about/policies/terms.jsp

.JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range ofcontent in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new formsof scholarship. For more information about JSTOR, please contact [email protected].

.

INFORMS is collaborating with JSTOR to digitize, preserve and extend access to Operations Research.

http://www.jstor.org

This content downloaded from 169.229.32.137 on Thu, 8 May 2014 18:06:57 PMAll use subject to JSTOR Terms and Conditions

http://www.jstor.org/action/showPublisher?publisherCode=informs

http://www.jstor.org/stable/222904?origin=JSTOR-pdf

http://www.jstor.org/page/info/about/policies/terms.jsp


0

Christos Alexopoulos is an Associate Professor in the School of Industrial and Systems Engineering at the Geor- gia Institute of Technology. His research interests are in the areas of applied probability, statistics, and optimization of stochastic systems. His recent work involves problems related to the optimal design of telecommunications and transportation systems. Dr. Alexopoulos is a member of INFORMS and the INFORMS College on Simulation. He served as a coeditor for the Proceedings of the 1995 Win- ter Simulation Conference. Akram A. El-Tannir is currently a visiting Assistant Professor at American University of Beirut, Lebanon. His research interests are in the area of stochastic processes and their applications in business and management. Prior to his present position, he worked in Kuwait as a consultant on management and information systems. Richard F. Serfozo is a Professor in the School of Industrial and Systems Engineering at the Georgia Insti- tute of Technology. His current research is on the charac- terization of flows in stochastic networks and spatial queueing systems.

Igor Averbakh is an Assistant Professor of Operations Re- search and Applied Mathematics at Western Washington University. He is an author of more than 30 journal papers in combinatorial optimization, integer programming, stochastic optimization, and networks algorithms. Oded Ber- man is a full Professor and the former Associate Dean of Programs at the Joseph L. Rotman School of Management at the University of Toronto. He has published over 100 articles and has contributed to several books in his field. He is the Area Editor of Services and Military for Opera- tions Research, Associate Editor of Management Science and Transportation Science, and member of the editorial boards for Computers and Operations Research and the Journal of Service Research.

Oded Berman, see Igor Averbakh.

Margaret L. Brandeau is a Professor in the Department of Industrial Engineering and Engineering Management, Stanford University. Her research interests include AIDS policy analysis and manufacturing systems modeling. She is currently funded by a grant from the National Institute on Drug Abuse entitled "Public-Health Impact and Cost Ef- fectiveness of HIV Interventions." The goal of the research is to develop and apply standardized mathematical and economic models for assessing the impact and cost- effectiveness of HIV- and drug abuse-related interventions. M. Eric Johnson is an Associate Professor at the Owen Graduate School of Management, Vanderbilt Uni- versity. Through grants from the National Science Founda- tion, Hewlett-Packard Company and Pepsi-Cola, he is conducting research in supply chain logistics including

manufacturing capacity planning, material handling system design, and inventory measurement and control. His articles have appeared in such journals as Management Sci- ence, Operations Research, Naval Research Logistics, IIE Transactions, and Transportation Science. He is currently an associate editor for Operations Research, Production and Operations Management, and Manufacturing & Service Op- erations Management.

Ron Brookmeyer, see Edward H. Kaplan.

Victoria C.P. Chen is an Assistant Professor in the School of Industrial and Systems Engineering at the Georgia In- stitute of Technology. David Ruppert is a Professor in the School of Operations Research and Industrial Engineering and Christine A. Shoemaker is a Professor in the School of Civil and Environmental Engineering, both at Cornell University. The paper in this issue resulted from a unique fusion of statistics and optimization methodologies and reflects the authors' interest in collaborations across disci- plines of operations research.

Anne De Jongh has recently completed a Ph.D. in Opera- tions Research at the Universite Libre de Bruxelles. Her dissertation written under the supervision of Martine Labbe and Michel Gendreau dealt with various bifurcated routing problems encountered in telecommunications networks. Michel Gendreau is a Professor at the Departement d'informatique et recherche operationnelle and Deputy Director of the Centre for Research on Transportation of the Universite de Montreal. His research interests cover a wide range of topics in transportation and telecommunications planning. Martine Labbe is a Professor at the Institut de Statistique et Recherche Operationnelle of the Univer- site Libre de Bruxelles. Her main research areas are combinatorial optimization, location theory, and network design.

Robert B. Dial is an Operations Research Analyst with the U.S. Department of Transportation's John R. Volpe Na- tional Transportation Systems Center. Besides network optimization models and algorithms, his current research includes the design and implementation of real-time demand-responsive routing and scheduling systems.

Akram A. El-Tannir, see Christos Alexopoulos.

Michel Gendreau, see Anne De Jongh.

M. Eric Johnson, see Margaret L. Brandeau.

Markku Kallio is a Professor of Management Science at the Helsinki School of Economics and Business Adminis- tration, and Charles H. Rosa is a consultant with the research group in the SABRE Group. Part of the work

171



172 / Contributors

described in their article was undertaken while both authors were research scientists at the International Institute for Applied Systems Analysis (IIASA) in Laxenburg, Austria.

Edward H. Kaplan is a Professor of Management Sciences and Public Health at the Yale School of Management. His research on modeling and evaluating AIDS interventions has been recognized with the 1992 Edelman Award and the 1994 Lanchester Prize. He coedited with Margaret L. Brandeau the book Modeling the AIDS Epidemic: Planning, Policy and Prediction (Raven Press, 1994). Ron Brookm- eyer is a Professor of Biostatistics at the School of Hygiene and Public Health of Johns Hopkins University. The recip- ient of the 1992 Spiegelman Gold Medal from the Ameri- can Public Health Association for contributions to health statistics, he is a Fellow of the American Statistical Asso- ciation. He coauthored with Mitchell H. Gail the book AIDS Epidemiology: A Quantitative Approach (Oxford Uni- versity Press, 1994). Their collaboration stemmed from their concern that insufficient information is available re- garding recent HIV incidence.

L. Robin Keller is an Associate Professor of Operations and Decision Technologies at the Graduate School of Management, University of California, Irvine. Her professional interests include decision analysis, risk analysis, and problem structuring. She served as a program director for the Decision, Risk, and Management Science Program at the National Science Foundation from 1989-91. She has been active in TIMS, ORSA, and INFORMS, including serving as TIMS Vice President-Finance, Founding Director-at-Large for INFORMS, and Chair-elect for the Decision Analysis Society of INFORMS. Craig W. Kirk- wood is a Professor of Management Science at the College of Business, Arizona State University. His professional interests include large-scale decision analysis models and decision analysis using partial or approximate information. Prior to joining Arizona State University, he was in the decision analysis group at Woodward-Clyde Consultants, San Francisco, where he conducted decision and risk analysis for management and engineering decision making. He has been active in ORSA, TIMS, and INFORMS, including serving as Treasurer of ORSA and INFORMS.

Craig W. Kirkwood, see L. Robin Keller.

Martine Labbe, see Anne DeJongh.

Pierre L'Ecuyer is a Professor in the Department of Com- puter Science and Operations Research at the University of Montreal. His current research focuses on stochastic discrete event simulation, with special emphasis on random number generation, optimization, and efficiency im- provement via variance reduction.

Zhaotong Lian, see Liming Liu.

Bin Liu, see Jing-Sheng (Jeannette) Song.

Liming Liu is an Assistant Professor in the Department of Industrial Engineering and Engineering Management at the Hong Kong University of Science and Technology. His research interest includes inventory models, queueing models, performance and optimization of assembly systems, and inventory control in manufacturing/logistics network settings. Zhaotong Lian is a research (postdoctoral) fellow in the Department of Mechanical and Industrial Engineering at the University of Massachusetts. This work is an outgrowth from part of Dr. Lian's dissertation with Professor Liu who has been studying different perishable inventory models over the past several years. Dr. Lian is now working in the areas of the supply chain management and agent-based artificial intelligence.

Kevin F. McCardle, see James E. Smith.

Charles H. Rosa, see Markku Kallio.

David Ruppert, see Victoria C.P. Chen.

Richard F. Serfozo, see Christos Alexopoulos.

Christine A. Shoemaker, see Victoria C.P. Chen.

Yves Smeers, see Jing-Yuan Wei.

James E. Smith is an Associate Professor and Kevin F. McCardle is a Professor of Decision Sciences at the Fuqua School of Business at Duke University. Their article is part of their ongoing research on developing methodology for valuing risky projects, emphasizing modeling options asso- ciated with projects, and incorporating information from futures and options markets.

Jing-Sheng (Jeannette) Song is an Associate Professor at the Graduate School of Management, University of Cali- fornia at Irvine. Her primary research interests lie in production and inventory management. The current paper reflects her continued effort in computing and understanding order-based performances in assemble-to-order manufacturing systems. Susan H. Xu is an Associate Professor at the Smeal College of Business Administration, Penn State University. Her primary research interest is centered on modeling, design, performance evaluation, and optimal control of stochastic systems and their applications in manufacturing, logistics, and communication systems. This paper reflects her interest in understanding the inner structure and behavior of correlated operating systems. Bin Liu is on the Research Staff of The Institute of Ap- plied Mathematics, Chinese Academy of Sciences. Dr. Bin Liu's research interest is in stochastic modeling and inventory theory.

Robert H. Storer, see S. David Wu.

Jing-Yuan Wei is a consultant with IDS Consultancy Ltd., Singapore. His consulting areas include supply chain models, ammunition storage, international telecommunication network planning and manpower planning. This paper is



Contributors / 173

an outgrowth of his dissertation in mathematical engineering at the Universite Catholique de Louvain, Belgium. Yves Smeers is a Professor of Industrial Engineering at the Universite Catholique de Louvain and scientific advisor for the Belgian power company, Electrabel. His research interest focuses on market simulation and risk management in deregulated gas and electricity industries.

S. David Wu is a Professor and the Interim Chair of the Industrial and Manufacturing Systems Engineering (IMSE) Department at Lehigh University. His current research is in manufacturing logistics with an emphasis on planning and scheduling robustness, combinatorial optimization, and distributed decision mechanisms. Eui-Seok Byeon is a Research Fellow in the Korea Transport Insti-

tute. He received his Ph.D. in industrial engineering from Lehigh University. His current research is in logistic information systems and production planning and scheduling. Robert H. Storer is an Associate Professor of IMSE at Lehigh University. His research interests lie in manufacturing logistics and include work on combinatorial optimization, scheduling, and process monitoring. The work described in this article is based on Byeon's dissertation under the supervision of Wu. The authors have published several related articles on robust scheduling in IEEE Transactions on Robotics and Automation, Naval Research Logistics, and IIE Transactions (with Leon).

Susan H. Xu, see Jing-Sheng (Jeannette) Song.



I A I A I * * I A I.

Operations Research publishes quality operations research and management science work of interest to the OR practitioner and researcher in three substantive categories: methods, data-based operational science, and the practice of OR. The journal seeks papers reporting underlying data-based principles of operational science, observations and modeling of operating systems, contributions to the methods and models of OR, case histories of applications, review articles, and discussions of the administrative environment, history, policy, practice, future, and arenas of application of operations research.

Complete studies that contain data, computer experiments, and model validation, and that integrate theory, methods, and applications are of particular interest. Thus, we encourage case studies of lasting value. Contributors should submit in- formal descriptions of cases to Interfaces.

In addition to the regular ARTICLES section, there are three special sections: OR PRACTICE contains practitioner- oriented applications, tutorials, and surveys. Application papers whose utility is as yet undemonstrated in practice or that are not tailored for practitioners should be submitted to the appropriate Area Editor. The OR CHRONICLE section publishes papers on history, policy, and analyses of current and future trends, as well as surveys and expository articles of

general interest to the OR community. TECHNICAL NOTES contains brief articles on all of the topics covered by the journal. For more information on subject coverage and editorial policy, see the Editorial and Area Editor statements published in the March-April 1996 issue.

All papers published in Operations Research are critically refereed. Initial refereeing of clear, concise, well-written manuscripts normally takes about four months for papers of average length; generally a shorter time is needed for notes.

Decisions to publish manuscripts in Operations Research wil be based, in part, on the answers to such questions as: Does this paper make a new and substantial contribution to the literature of operations research? Will it be of interest to a significant group of OR workers? Does the paper give sufficient introductory and summary material to inform readers of the context, importance, and possible fields of application of the material covered? Is it clearly, concisely, accurately, and logically written? Could it benefit from condensation or expansion? Is its character clear from the title, abstract, and text? Does the paper describe its relation to previously published work, and does it give adequate credit and references to this work?

It is to be understood that the final decision concerning publication rests with the Editor.

INSTRUCTIONS FOR CONTRIBUTORS

General Considerations

Submission of a paper to Operations Research is a two-step process. In the first phase, the author should submit (electron- ically if possible, or FAX) the Statement of Contribution to the appropriate Area Editor to ascertain its suitability for publication in the journal.

If the Area Editor deems the topic acceptable, the author is then invited to submit the entire manuscript package for review. This package includes the Statement of Contribution, signed Copyright Transfer Agreement, cover letter, and the manuscript. This submission can either be in hard-copy format (four, double-spaced typewritten copies) or in electronic form. The author must check with the Area Editor as to which electronic forms are acceptable.

Papers not in the fields covered by the Area Editors (listed on the front inside cover of each issue) should be sent to:

Patrick T. Harker Editor, Operations Research Department of Operations and Information Management (OPIM) 1300 Steinberg Hall-Dietrich Hall The Wharton School 3620 Locust Walk Philadelphia, PA 19104-6366 [email protected]

Papers should not be sent to the Associate Editors.

For an up-to-date description of the editorial policies, submission instructions, and area statements, authors are referred to the World Wide Web home page of the journal:

http://opim.wharton.upenn.edu/-harker/opsresearch.html

Submission of a manuscript is a representation that the paper has neither been published nor submitted for publication elsewhere, and that, if the work is officially sponsored, it has been released for open publication. The manuscript should be accompanied by a Copyright Transfer Agreement from the authors (or their employers-whoever holds the copyright) transferring the copyright to INFORMS. The form for this agreement is printed in most issues of this journal and is also available from the Managing Editor. This written transfer of copyright, which previously was assumed to be implicit in the act of submitting a manuscript, is necessary under the 1978 U.S. Copyright Law in order for INFORMS to continue disseminating operations research results as widely as possible.

Manuscripts will not be returned to an author unless specif- ically requested, or unless reviewers have provided annota- tions that will be of use to the author.

The text should be arranged as follows: title page, abstract, introduction, main sections, appendix, acknowledgment, and references. The appendix and acknowledgment are optional.

Observe the following points in preparing manuscripts. (Pa- pers not conforming closely to these instructions will be returned to their authors for appropriate revisions.)



1. Statement of Contribution. A statement of contribution is required for each submitted paper. The form will appear in nearly every issue of the journal and should be completed and submitted prior to the submission of a paper to an Area Editor (see the Electronic Operations Research Initiative for details). The purpose of this statement is to aid Area Editors and reviewers in determining if the paper is appropriate for the journal and meets its stated objectives. Once a paper is accepted for publication, this statement will serve as the basis for the In This Issue column.

When preparing this statement, include the following: Why is the topic that is addressed in the paper important? What specific contributions does the paper make to operations research? What do you believe is the basis for publication? Provide a brief assessment of the near and long-term implications of the contribution. Keep the statement brief, preferably fitting into the space allocated on the printed form. Try not to overflow the page; however, a longer statement may be submitted if you believe that such an explanation is necessary. The statement should be expository and contain no mathematical notation. Failure to complete this item will delay the start of the review process.

2. Readability. The abstract and the introduction of every paper must be free of unnecessary jargon and clearly readable by any INFORMS member. These sections should be written in an expository style that will be comprehensible to readers who are not technical experts in the subject matter.

3. Title Page. Each paper should have a title page that contains the authors' names and addresses. The usual acknowledgments should be placed in a separate section at the back of the manuscript.

4. Abstract. Preface each article with a self-contained, one paragraph abstract that summarizes the problem and the prin- cipal results and conclusions. It should not contain formulas, references or abbreviations, nor exceed 200 words.

5. Introduction. The introduction must clearly state the problem, the results to be found in the paper and their signif- icance to the OR community. It should not contain equations or mathematical notation. The introduction does not have a section heading or a number.

6. Main Sections. The main sections of the paper must be readable, the level of the mathematics and/or the terminology appropriate to the topic, and the material logically presented. Begin section numbering and headings with these sections.

7. Style. The message of your paper will be enhanced if it is presented in active, forceful, and concise prose. Since good writing is a craft at least as difficult as doing operations research, before beginning your paper you will be well advised to refresh your acquaintance with the most important points of good style by spending some time with a source of good editorial advice, such as Writing a Technical Paper by Donald H. Menzel, Howard Mumford Jones, and Lyle G. Boyd (New York: McGraw-Hill, 1961). While the Editor and staff will correct minor lapses from good style in your manuscript, they cannot undertake wholesale revisions of poorly written papers. There is no a priori limit to the number of pages for a paper; however, conciseness and clarity of presentation are important publication criteria.

8. Spacing and Format. Double space manuscripts throughout, including the abstract, subsidiary matter (list of captions, for example), and references. In general, keep figures and tables to a minimum that is consistent with an adequate presentation of the textual information.

Each page of the manuscript should be numbered. Indent the first line of each paragraph. Spelling and hyphenation will follow Websters Third New Intemational Dictionary (unabridged).

9. Footnotes. Operations Research does not use footnotes; incorporate subsidiary material that would otherwise appear in footnotes in the main text, possibly in parentheses or brackets, or place it in a Notes section at the end of the text, before the Acknowledgment and References. Designate notes by using superscript numerals placed in serial order throughout the text.

10. Acknowledgment. Place acknowledgments of presentation, support, and assistance in a final section that precedes the References, not on the title page.

11. References. List only those references that are cited in the text. References in the text should be cited by the author's surname and the year of publication-for example, Flood (1962). If the reference has two or three authors, cite all of the authors' surnames and the year of publication-Flood, Smith and Jones (1982). If the reference has more than three authors, cite the first author's surname followed by et al. and the year of publication-Brown et al. (1985). If there is more than one reference by the same author with the same year of publication, the first citation appearing in the text would read Flood (1962a), the second citation would read Flood (1962b), etc. Do not use parentheses or brackets for dates when the citation is already enclosed within parentheses. At the end of the paper list references alphabetically by the last name of the first author. Do not number the reference list. Double space this final section.

For journal references, give the author, year of publication, title, journal name, volume, and pages-for example:

Flood, M. M. 1962. New operations research potentials. Oper. Res. 10 423-436.

For book references, give the author, year of publication, title, publisher, city, state, and pages-for example:

Morse, P. M., G. E. Kimball. 1951. Methods of Operations Research. John Wiley, New York, 44-65.

For references to working papers or dissertations, cite the author, title, type of document, department, university, and location, for example:

Rosenwein, M. 1986. Design and Application of Solution Methodologies to Optimize Problems in Transportation Lo- gistics. Ph.D. Dissertation. Department of Decision Sciences, University of Pennsylvania, Philadelphia.

12. Mathematical Expressions. Within the text, use the so- lidus whenever possible in preference to built-up fractions,

a e.g., a/(1 - b) rather than 1 ; write complicated exponen- tials in the form exp( ); avoid subscripts or superscripts on subscripts or superscripts; and, in general, minimize unusual typographical requirements. For displayed equations, use built-up fractions. Avoid lengthy equations that will take several lines to typeset (possibly by defining terms of the equations in separate displays).

Make subscripts and superscripts large and clear, and shown in a clearly inferior or superior position. The letter 1 and the numeral 1 and the letter 0 and the numeral 0, which are identical on most keyboards, should be identified. Symbols and Greek letters should be identified clearly: On their first



occurrence, label unusual or ambiguous symbols by marginal notes. The difference between upper and lower case letters should be clear.

Display only those mathematical expressions that must be numbered for later reference or that need to be emphasized. Number displayed equations consecutively throughout the paper; do not number equations by section numbers. Appendix equations can be labeled A.1, A.2, etc. The numbers should be placed in parentheses to the right of the equation.

13. Reporting Computational Experience. In reporting computational experience on the efficiency of algorithms follow the guidelines given in Operations Research, Volume 29, No. 2, "Reporting Computational Experience in Operations Research. "

14. Tables. Tables should be numbered with roman numerals, have a title, and be referred to sequentially in the text. Column headings should be brief and not use abbreviations. Do not use vertical rules. The use of footnotes is encouraged; designate these by lower case letters. The submission of original tables suitable for reproduction is not necessary; all tables will be typeset for consistency. Each table should be on a separate sheet and not interleaved in the text.

15. Figures. Line drawings should be prepared as a Post- Script file or should be in black ink or preferably via a laser printer or plotter on white bond or vellum paper. For best results, fit the figure onto a 8 1/2 x 11 inch sheet with at least a 1 inch margin all-around. Original drawings will be required on acceptance of a paper. Copies are sufficient for reviewers.

Lettering should be done on a computer, with a mechanical lettering set, or its equivalent. The figure should be of sufficient size so that after photoreduction, letters and numbers are legible.

Do not clutter the figure with information that makes it difficult to read. All details on the figures should be checked carefully because correction on proofs necessitates reshooting.

Each figure must be cited and will be placed in the order mentioned in the text. Each figure must have a caption and a number (Arabic). Do not place the caption on the original of the figure-these go on a separate sheet. Do not differentiate between illustrations and figures.

Lines must be sufficiently thick to reproduce well, and dec- imal points, periods, and dots must be sufficiently large to allow for reduction. The same type of lettering should be used for all figures. The figure and the lettering should be in pro- portion so that both can accommodate reduction. Do not use different sized type within a figure.

16. Subject Classification Scheme for the OR/MS Index. Determine the appropriate subject classifications (up to 3) and accompanying descriptive phrases for all work submitted. A complete list of categories appears at the back of most issues; refer to the revised scheme as it appears in Volume 37,

No. 1 (January-February 1989) and in subsequent issues. Choose from one to three subject categories for each manuscript. For eveiy categoiy chosen, write a short phrase that puts the paper in context. (The phrase can be a concise rendering of the title, or it may specify some aspect of the paper that is important but not apparent in the title.) The length of each phrase, including spaces and punctuation, should not exceed 60 characters. This information will be printed on the title page of every article, technical note, and letter that is published.

Subject categories and phrases must either appear on the title page of the manuscript (this is the preferred method), or authors may use the form provided (see the bottom half of the Copyright Transfer Agreement).

Do not repeat the subject classifications from the subject categories. The accompanying phrase should help to further clanify the paper within a subject category.

17. Reprints. Operations Research does not have paper charges, nor does it supply free reprints. Authors of accepted articles may order reprints at reasonable rates at the time they submit their corrected galley proofs. Reprints of individual articles are not available from INFORMS.

Reproduction of Journal Articles

1. Permission is granted to quote from this journal in scientific works with the customary acknowledgment of the source. The reprinting of a figure, table, or an excerpt requires the consent of one of the original authors and the notification of INFORMS.

2. Reprinting of any article or a portion of an article beyond that permitted in Paragraph 1 requires written permission from the copyright holder (INFORMS) and payment of an appropriate royalty. Reprinting requests should be directed to the INFORMS Business Office and should contain the following details: author, title, volume, number, year, in- tended purpose or use of the article (book, journal, abstract, anthology, etc.), and estimated sale price of the work. Permis- sion must first be obtained from the author(s) and submitted to INFORMS with the request.

3. Copying without fee is permitted provided that the copies are not made or distributed for direct commercial advan- tage and are distributed without charge beyond cost. Credit to the source should be given, and abstracting with credit is permitted. Other copying of articles is permitted provided that a per-copy fee is paid through the Copyright Clearance Center, Inc., 222 Rosewood Drive, Danvers, MA 01923, (508) 750-8400. For permission to republish, write to INFORMS (401 Elkridge Landing Road, Suite 400, Linthicum, MD 21090-2909). To copy otherwise, or to republish, requires a separate fee and/or specific permission.

Announcements should be sent to John Llewellyn Lionheart Publishing, Inc. 2555 Cumberland Parkway Atlanta, GA 30339

Books for Review should be sent to Professor Benjamin Lev Book Review Editor, Interfaces School of Management University of Michigan-Dearborn 4901 Evergreen Road Dearborn, MI 48128-1491



COPYRIGHT TRANSFER AGREEMENT

Copyright to the article entitled "...........................................

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

by. is hereby transferred to the Institute for Operations Research and the Management Sciences (INFORMS) (for U.S. Government employees: to the extent transferable), effective if and when the article is accepted for publication in Operations Research. However, the authors reserve the following: (1) All proprietary rights other than copyright, such as patent rights. (2) The right to grant or refuse permission to third parties to republish all or part of the article or translations thereof. In the case of whole articles, such third parties must obtain INFORMS's written permission as well. However, INFORMS may grant rights with respect to journal issues as a whole. (3) The right to use all or part of this article in future works of their own, such as lectures, press releases, reviews, textbooks, or reprint books. In addition, the authors affirm that the above article has been neither copyrighted nor published, that it is not being submitted for publication elsewhere, and that, if the work is officially sponsored, it has been released for open publication.

To be signed by at least one of the authors (who agrees to inform the others, if any) or, in the case of a "work made for hire," by the employer.

SIGNATURE SIGNATURE

PRINT NAME PRINT NAME

TITLE, IF NOT AUTHOR TITLE, IF NOT AUTHOR

DATE DATE

This signed statement must be received by the Editor's office before a manuscript can be accepted for processing. Address requests for further information or exceptions to INFORMS, 901 Elkridge Landing Road, Suite 400, Linthicum, Maryland 21090-2909.

SUBJECT CLASSIFICATION FOR THE OR/MS INDEX

Classify manuscript under one, two, or three subject categories. A complete list of subject categories appears on adjacent pages in most issues of this journal. For every subject category chosen, write a short phrase that places the manuscript in its proper context within the subject category. The total length of each phrase, including spaces and punctuation, must not exceed 60 characters.

Example. A paper entitled "Cost-Effectiveness in Urban Transportation" might be classified under two subject categories: "Cost analysis" and "Transportation, costs." On this Subject Classification form the categories and accompanying phrases might be: cost analysis: urban transportation and transportation, costs: cost-effectiveness in urban transportation. Do not repeat the subject classification (e.g., cost analysis or transportation) from the subject categories. The descriptive phrase should further clarify the paper within the subject category.

SUBJECT DESCRIPTIVE CATEGORY PHRASE

1.

2.

3.



Please refer to the Copyright Transfer Agreement or to Operations Research Editorial Policy, Section 16, for instructions on choosing the appropriate categories and accompanying phrases for your paper.

Accounting Analysis of algorithms

Computational complexity Data structures Suboptimal algorithms

Communications Computers/computer science

Artificial intelligence Data bases Microcomputers Software System design/operation

Cost analysis Decision analysis

Applications Inference Multiple criteria Risk Sequential Systems Theory

Dynamic programming/ optimal control

Applications Deterministic Markov

Finite state Infinite state

Models Semi-Markov

Economics Econometrics Input-output analysis

Education systems Operations Planning

Engineering Environment Facilities/equipment planning

Capacity expansion Design Layout Location

Continuous Discrete Stochastic

Maintenance/replacement Finance

Asset pricing Capital budgets Capital rationing Corporate finance Depreciation Investment Investment criteria Management Portfolio Securities Taxation Working capital

Financial institutions Banks Brokerage/trading Insurance Investment

Forecasting Applications

Forecasting (continued) ARIMA processes Delphi technique Regression Time series

Games/group decisions Bargaining Bidding/auctions Cooperative Differential Gambling Nonatomic Noncooperative Stochastic Teams Voting/committees

Government Agencies Defense Elections Energy policies Foreign policy Programs Regulations Services Tax policy

Health care Ambulance service Blood bank Diagnosis Epidemiology Hospitals Pharmaceutical Treatment

Industries Agriculture/food Chemical Communications/journalism Computer/electronic Electric Hotel/motel Lumber/wood Machinery Mining/metals Petroleum/natural gas Pharmaceutical Recreation/sports Real estate Textiles/apparel Transportation/shipping

Information systems Analysis and design Decision support systems Expert systems Management

Inventory/production Applications Approximations/heuristics Multi-item/echelon/stage Operating characteristics Perishable/aging items Planning horizons Policies

Disposal/issuing Maintenance/replacement Marketing/pricing

Inventory/production (continued)

Review/lead times Scale-diseconomies/

smoothing Scale-diseconomies/lot-sizing Sensitivity analysis Uncertainty

Deterministic Stochastic

Judicial/legal Crime Crime prevention Law Penal system

Labor Libraries Manufacturing

Automated systems Performance/productivity Strategy

Marketing Advertising and media Buyer behavior Channels of distribution Choice models Competitive strategy Estimation/statistical

techniques Industrial marketing International marketing Marketing mix Measurement New products Pricing Product policy Promotion Retailing and wholesaling Salesforce Scaling methods Segmentation

Mathematics Combinatorics Convexity Functions Fixed points Piecewise linear Matrices Sets Systems solution

Military Cost effectiveness Defense systems Force effectiveness Logistics Personnel Search/surveillance Stochastic duels Tactics/strategy Targeting Warfare models

Natural resources Energy Land development Water resources

Networks/graphs Applications

Networks/graphs (continued) Distance algorithms Flow algorithms Generalized networks Heuristics Matchings Multicommodity Stochastic Theory Traveling salesman Tree algorithms

Organizational studies Behavior Decision making Design Effectiveness/performance Goals Information Leadership Manpower planning Motivation/incentives Personnel Productivity State-owned Strategy Structures

Philosophy of modeling Planning

Community Corporate Government Urban

Population Family planning

Probability Applications Clearing processes Crossing problems Diffusion Distribution comparisons Distributions Entropy Markov processes Random walk Renewal processes Regenerative processes Stochastic model

applications Production/scheduling

Applications Approximations/heuristic Cutting stock/trim Flexible manufacturing/

line balancing Learning Planning Sequencing

Deterministic Single machine Multiple machine

Stochastic Professional

Addresses Comments on Humor/satire Journal policies Obituaries



Professional (continued) OR/MS education OR/MS implementation OR/MS philosophy OR/MS policy/standards

Programming Complementarity Fractional Geometric Infinite dimensional Integer

Algorithms Benders/decomposition Branch-and-bound Cutting plane/

facet generation Group Heuristic Relaxation/subgradient

Applications Nonlinear Theory Interval Linear

Algorithms Applications Large-scale systems Parametric Theory

Multiple criteria Nondifferentiable Nonlinear

Algorithms Applications Theory

Programming (continued, Unconstrained Quadratic Stochastic

Project management CPM GERT PERT Resource constraints VERT

Queues Algorithms Applications Approximations Balking and reneging Batch/bulk Birth-death Busy period analysis Cyclic Diffusion models Feedback Limit theorems Markovian Multichannel Networks Nonstationary Optimization Output process Priority Simulation Statistical inference Tandem Transient results

Recreation and sports

Reliability Availability Coherent structures Failure models Inspection Life distributions Maintenance/repairs Multistate systems Quality control Redundancy/spares Replacement/renewal System safety Shock models

Research and development Innovation Project selection

Search and surveillance Simulation

Applications Design of experiments Efficiency Languages Random variable generation Statistical analysis System dynamics

Space program Statistics

Analysis of variance Bayesian Censoring Cluster analysis Correlation Data analysis Design of experiments

Statistics (continued) Estimation Nonparametric Pattern analysis Sampling Time series

Technology Transportation

Automobile Costs Freight/materials handling Fuel Mass transit Models

Assignment Network Location Traffic

Safety/injuries Scheduling

Personnel Vehicles

Taxis/limousines Travel

Mode/route choice Vehicle routing

Utility/preference Applications Estimation Multiattribute Theory Value theory



Each time a paper is submitted to Operations Research, it should be accompanied by a Statement of Contribution. The purpose of this statement is to help the area editor and the referees determine if a paper meets the stated objectives. After a paper is accepted for publication, this statement will serve as the basis for the "In This Issue" column. This column appears in each issue of the Journal and precedes the presentation of articles. Prior to acceptance, this statement will become part of a paper's file and will accompany the paper during the review process.

When preparing this statement, include the following: Why is the topic addressed in your paper important? What specific contributions does the paper make to OR? What do you believe is the basis for publishing your paper? Finally, provide a brief assessment of the near and long-term implications of your contribution.

Provide an answer to each question, preferable using the form provided below. If your statement overflows the one paragraph space provided, use additional pages. Attach one copy of the completed statement, along with a Copyright Transfer Agreement and Subject Classification form, to your submission. If you fail to complete the Statement of Contribu- tion, it may delay the start of the review process.

AUTHORS

TITLE

STATEMENT



* -

.LJILt BOOKS&JOURNALS IN

.,-0-;-X:Jss2fs>:s5i 2 _ ~Iterative Methods Matrix Algorithms for Optimization Volume 1: Basic Decompositions

A00<- l C. T Kelley G. W. Stewart :^:;<; w ,'?'&,N,'',', Frontiers in Applied Mathematics 18 This thorough, concise, and superbly written volume

_ ' ; ., ..~.. This book presents a carefully selected group of is the first in a self-contained five-volume series de- methods for unconstrained and bound constrained voted to matrix algorithms. It focuses on the compu- opt imization problems and analyzes them in depth tation of matrix decompositions that is, the factor- both theoretically and algorithmically. It focuses on ization of matrices into products of similar ones. clarity in algorithmic description and analysis rather 1998 * xr + 458 pages Softcover ISBN 0-89871-414-1

than generality, and while it provides pointers to the literature for the most List Pr-ice $32.00 * SIAM Memiber Pr-ice S25.60

general theoretical results and robust software, the author thinks it more impor- Order Code OT60 tant that readers have a complete understanding of special cases that convey SIAM Journal on Optimization essential ideas. A companion to Kelley's book, Iterative Methods for Linear and Nonlinear Equations (SIAM, 1995), this book contains many exercises and Contains research articles on the theory and practice

examples and can be used as a text, a tutorial for self-study, or a reference. of optimization. The areas addressed include linear

Available March 1999 Approx. 200 pages Softcover - ISBN 0-89871-433-8 and quadratic programming, convex program- List Price S37.00 SIAM Member Price $29.60 * Order Code FR18 ming, nonlinear progrmming, Complementarity

problems, stochastic optimization, combinato- NJumerical Linear Algebra rial optimization, integer programming, and for High-Performance Computers ......... convex, nonsmooth and variational analysis. Jack J. Dongarra, lain S. Duff, Contributions may emphasize optimization Danny C. Sorensen, and Henk A. van der Vorst theory, algorithms, software, computational Software, Environments, and Tools 7 practice, applications, or the links between

.

. X A ~~~~~~~~~~~~~~~these subjects. Pliblished quarterIv. This book presents a unified treatment of recently developed t t

techniques and current understanding about solving systems of 1999 List Price. $316 ,SA, Canacda, and Mexico linear equations and large scale eigenvalue problems on high- $360 overseas

performance computers. It provides a rapid introduction to the c e n eio w print I _ { A~~~~~~.ccelet-ated electi-os1ic-onli, editioti wi th pi-int

world of vector and parallel processing for these linear algebra subscription. free uipon request.

applications. Topics include major elements of advanced- SIAM Accelerated electronic-only edition without pr-int architecture computers and their performance, recent algorithmic Optinuzation subscription. $284 (worldwide) development, and software for direct solution of dense matrix - ------ 1999 SIAM individual nember rates: problems, direct solution of sparse systems of equations, iterative solution of $60 IJSA, Canada, Mexico $ g64 overseas

sparse systems of equations, and solution of large sparse eigenvalue problems. print or printplus electronic access)

7Rovalties.fromn the sale of this book are contributed to the SIAM student travel fund. D m - x -

1998 * xviii + 342 pages * Softcover - ISBN 0-89871-428-1 List Price $37.00 - SIAM Member Price $29.60 ' Order Code SE07 USE YOUR CREDIT CARD (AMEX. MC, VISA):

| * Phone 800-447-SIAM in USA & Canada Introduction to Matrix Analytic Methods I or 215-382-9800 worldwide

in Stochastic Modeling * Web* https.I/www ;1siam.org/cataloglbookord,:1htnI

G. Latouche and V. Ramaswami * Fax 215-386-7999 ASA-SIAM Series on Statistics and Applied Probability 5 * E-mail service(saian.org.

Matrix analytic methods are popular as modeling tools because they give one the OR SEND CHECK OR MONEY ORDER TO ability to construct and analyze a wide class of queuing models in a unified and SIAM, Dept. BKOR99, P.O. Box 7260.

algorithmically tractable way. The authors present the basic mathematical ideas Philadelphia, PA 19101-7260.

and algorithms of the matrix analytic theory in a readable, up-to-date, and Shipping and Handling: USA: Add S2.75 for first book

comprehensive manner. In the current literature, a mixed bag of techniques is and $.50 for each additional book. Canada: Add S4.50 for used some probabilistic, some from linear algebra, and some from transform first book and S 1.50 for each additional book. Outside

methos. Hre, any ew poofs hat mphaize he uity o thematrx anlyti USA/Canada: Add S4.50 per book. All overseas delivery method. Here many ew profs tht emphs1ze te un1y of te matrx analt1c 1is via airmail.l approach are included. *.l

I ~ ~~~ non1 u ith secure orderilngI Available Februaryn 1999 * Xiv' ? 334 pages *'Softcover ' ISBN 0-89871-425-7 w w * r * oI List Price $49.50) 'ASA 'SIAM MHember Pr-ice $39. 60 ' Order Code SAO0 WwwSlammorgl

.

S.Lamlt SOC I ETY f or I ND U ST RI AL a nd AP PL I ED MATH E MAT IC S



. ...... : .. ... .. : ..R. .. .... .. .. ... .Ei- .......R:'

S... . .. . . . -, .....:: : - 1 . :........ <.: . ::: :::....iL -fS': : :: :: :: :::::

Ivey cases are used by the world's top 25 business schools, including Harvard. Ivey is

......: . .: ..: . :........:.'.:;R. - : :: ::

. .::::: the 2nd largest producer of business cases in the world, with 1800 classroom tested cases

...........i V 'and 150 new cases added each year. Ivey |r . s , ~~~~~~~~~~~~~~~. ...............--E E- E R < <

is also the world leader in Asian business . ::S.......... ........ 'C;0'fSR..S ti:i 4;0 00

E.. .... i_ -i_00-: case writing. t:..-:..:....::::_a>.sUse.. bsn s cases that k p . [ i: . 0 > . . .: ~~~~~~~~ ~ ~~~~~...g : . .. ....... .......... t:i:

:: : ::::: S : ~~~~~~~~~~........:-.*.9 ..: - :i .......:.:::::i:......>: iS;::.:i::::::....: :

E:: .......::: :::.:.:: :::...... ..:.:::.::*.:.::f;i:::Sf .. . l . .............. ....... --::-::--students talking even after class.

[~ ~ ~ ~~~~~~~~~~~~~~~a 51-6138 or. E-ai at [email protected].^::..

t .....d in . t imt.a. t . . ...... .. ....i _ t .e.el. secure a t y ina..- .sur t c. N . . I ... ..

..-, .

, ..

.....

t~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~~~~~oeae Reial prvdes Portab::Sf;3.le

Ws - -ti -:{- E

Fo~~~~~~~~~rep resentative. Bcause yo ant ie r cal/vyPbihng

E .i. si.. , . . -. . ::... :;i; :i:::

,,,,.- ... ::0 i:0 'i . *<X. - ' ! insurance pA n yucazrrr1n couznt ron

i.::f .: i: :. - . *.6

l ~~~~~~~Ttsp grms .Fadm59-61-382er Ed-Sabr mailth,aarsh&McLennanCompan

t ... ..... :. & B &

1~~~~~~~~~~h term cseand copehensc helocre nnepasatudercroen bteN ourk Ltes nsatane: Company, SaMadsonAens. IeYr,NY100

Th, aa, mh mao meicalT an hig limi acidn ,inranepas aeadrcisnbyUie Stte Lfe srance C ompn inosh cit f Nes ok,30 Rnoamse6 Nepane. l NJ074

................. .......-; # s l ct x e ie c d pr v d r w t h

. . . . . . . . . . ... i-f\:;:E;f ebrhpbnft. Afford..... ..............................~;: . o e a e e i b e r v d . P r a l ........... ~ ~ ~ ~ ~ ~ ~ ~ v* eeft. al80 2W983,o .......... . a g s i go , C 2 2 4 7 S 2 ~~~~~<.9i:.:. . _ . . . ............t.-ea t a c st me s rv c

I ._ .re.e.....e Bcase ouwan a .............. ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ! I.. y E ........~~~ ~ ~ ~ ~ ... ...R: isrne pln yu cn on n ................. ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ E. $ $ R 9

| h.tr....adcopehnie elt.eisuacepan r Foer rie bv freNew York pLi e casurn e Cmanv, 51Mdirecory ca ll Ivey PublishNY000 | h ebr sitnean iaii icm rtcto nuacepasaeuneurte b NMLf IsrneCmpn fAeic,1 .praePaeSut,Psaaa. J085 | h.eicr upemn.nuanepa s newite .teMouetlLieIsrnc opn, atmr, D221 | Te atstope ajr edca ad ig lmi acien isuane las reuner rttn y niedStte8LfeInurnc4Cmpnyinth5ct, ore Yok,3609oue66,Netue,NJ0754



SLOAN

MANAG EMENT REVI EW _~~~~~~~~~~~~~~~~

Join today's most effective and

successful managers - subscribe _____________ to Sloan Management Review.

M a n a g e m e n t R e v i e w SMR reveals management innovation

from experts around the world, _ Strategy toeseatios adl the Quest for Value

Strategy lovatian and th Quest forValuechallenges your strategic thinking, and IntellectualCapital = Commitment Competence shows how you can apply the latest

Negatiating Crass-Border Acquisitions management techniques in your organization. Published by MIT's

: _. Successftl Knawledge Management Projects

~~~~~~~~~~~Sloan School of Management for over How Do You Win the Capital Allocatian Game? 35 years, SMR is the leader's forum

for innovation. Innovative lntrastructure ftr Agile Manufacturers

Preservg Emplayee Morale daring Downsiting Start your subscription today!

SLOAN MANAGEMENT REVIEW .. . Where Gr-eat Ideas Begin

web.mit.edu/smr-online/

YIES, ~~~~~~~~~~~~~~~~~~~~~~Please Print Clearly ID YES, please start my subscription for:

One Year

J $79 .... U.S.A.

3 $99 .... Canada CONIPANY

1 $110 .... International

[ Check enclosed (US$ drawn on US Bank) STREET

Q Credit Card: CITY/POSTAL CODE

[ T VIjSA Mastercard [ AmEx

Card # ____________________COUN'TRY

Expire Month/Yr: /________ Please allow 4-6 weeks for deliverx.

. ~~~~~~~~~~~~For fastest service, fax your order: 303-661-1816. Signature:

_ ~~~~~~~~~~~~~MIT SLOAN M a nag e me nt R ev ie w ~J Please send invoice Box 55254, Boulder CO 80322 580P



* S' SB

President

Thomas L. Magnanti Sloan School of Management E40-147, MIT One Amherst Street Cambridge, MA 02139-4307

President-Elect

John R. Birge Department of Industrial and

Operations Engineering University of Michigan 1205 Beal Street Ann Arbor, MI 48109-2117

Secretary

James C. Bean Department of Industrial and

Operations Engineering University of Michigan 1205 Beal Street Ann Arbor, MI 48109-2117

Treasurer

Craig Kirkwood Department of Management Arizona State University Tempe, AZ 85287-4006

Past President

Karla L. Hoffman Department of Operations Research

and Engineering Science & Technology, Bldg. #2, Rm. 111 George Mason University 4400 University Drive Fairfax, VA 22030

Vice President-Information Technology

Matthew Saltzman Clemson University Department of Mathematical Sciences Martin Hall, P.O. Box 341907 Clemson, SC 29634

Vice President-International Activities

Michael J. Magazine University of Cincinnati College of Business Department of QA/OM Cincinnati, OH 45221-0130

Vice President-Meetings

Thomas R. Gulledge Institute of Public Policy George Mason University 10640 Page Avenue, Suite 400 Fairfax, VA 22030-4000

Vice President-Practice Activities

Thomas Spencer, III OR Department AT&T Labs 379 Campus Drive, Room 3B-310 Somerset, NJ 08873

Vice President-Publications

Mark S. Daskin Department of Industrial Engineering

and Management Sciences 2225 North Campus Drive Northwestern University Evanston, IL 60208

Vice President-Subdivisions

Anantaram Balakrishnan Pennsylvania State University 303 Beam Building University Park, PA 16802-1913

Director at Large Not Residing in US (1999-2001)

Jan Karel Lenstra Department of Mathematics and

Computer Science Eindhoven University of Technology P.O. Box 513 5600 MB Eindhoven The Netherlands

Directors at Large (1998--2000)

Cynthia Barnhart Massachusetts Institute of Technology 77 Massachusetts Avenue

Room #1-229 Cambridge, MA 02139

Michael A. Trick Graduate School of Industrial

Administration Carnegie Mellon University Pittsburgh, PA 15213

Director at Large (1997-1999)

Ludo Van der Heyden INSEAD Boulevard de Constance Fontainebleu Cedex F77305 France

Director for Division A (1999-2001)

David Rogers University of Cincinnati Department of QA/OM P.O. Box 210130, 531 Carl H. Lindner

Hall Cincinnati, OH 45221-0130

Director for Division B (1998-2000)

Leslie D. Servi GTE Laboratories Inc. 40 Sylvan Road Waltham, MA 02454

Director for Division C (1997-1999)

Michael J. P. Shaw Department of Business

Administration University of Illinois 360 Commerce West Champaign, IL 61820

Director for Division D (1999-2001)

Kathryn Stecke School of Business Administration University of Michigan 701 Tappan, Room 5206 Ann Arbor, MI 48109-1234

Director for Division E (1998-2000)

Douglas A. Samuelson Infologix 8711 Chippendale Court Annandale, VA 22003

Execuitive Director

Mark Doherty INFORMS 901 Elkridge Landing Road Suite 400 Linthicum, MD 21090-2909

Editors

Information Systems Research

Izak Benbasat Faculty of Commerce and

Business Administration University of British Columbia Vancouver, BC V6T 1Z2 Canada

INFORMS Journal on Computing

Bruce L. Golden College of Business and Management University of Maryland College Park, MD 20742

Interfaces

Michael H. Rothkopf RUTCOR-Rutgers University P.O. Box 5062 New Brunswick, NJ 08903-5062

Interactive Transactions of Operations Research and Management Science (ITORMS)

Ramesh Sharda College of Business Administration Oklahoma State University Stillwater, OK 74078-0555

INFORMS Online (http:// www.informs.org/)

Michael Trick GSIA Carnegie Mellon University Pittsburgh, PA 15213

Management Science

Hau L. Lee Department of Industrial Engineering Stanford University Stanford, CA 94305-4024

Manufacturing & Service Operations Management

Leroy B. Schwarz Krannert Graduate School of

Management Purdue University West Lafayette, IN 47907

Marketing Science

Brian Ratchford 215 Jacobs SUNY Buffalo Buffalo, NY 14260

Mathematics of Operations Research

Gerard Cornuejols Graduate School of Industrial

Administration Carnegie Mellon University Schenley Park Pittsburgh, PA 15213-3890

Operations Research

Patrick T. Harker The Wharton School University of Pennsylvania Philadelphia, PA 19104-6366

Organizatiotn Science

Claudia Bird Schoonhoven Graduate School of Management University of California, Irvine Irvine, CA 92697-3125

Topics In Operations Research

Stephen J. Balut Institute for Defense Analyses 1801 North Beauregard Street Alexandria, VA 22311

Transportation Science

Gilbert Laporte Centre de Recherche sur les

Transports Universite de Montreal CP 6128, Succursale Centre-ville Montreal, Quebec Canada H3C 3J7

OR/MS Today

John Llewellyn Lionheart Publishing, Inc. 2555 Cumberland Parkway Suite 299 Atlanta, GA 30339

Operations Research A bimonthly journal published in February, April, June, August, October, and December by the Institute for Operations Research and the Management Sciences at 901 Elkridge Landing Road, Linthicum, Maryland 21090-2909.

Subscription Services Subscription prices per volume: libraries/corporations-$207 a year, nonmember individuals- $130 a year. Membership rates: regular members-$55 a year, students (with faculty certification of student status) and retired members-$27.50 a year. Reprints of individual articles are not available; direct inquiries about bulk rates and single copies, as well as all correspondence (subscriptions, membership dues, changes of address) to:

INFORMS, 901 Elkridge Landing Road, Suite 400, Linthicum, Maryland 21090-2909 www.informs.org.



ASSOCIATE EDITORS David P. Ahlfeld

University of Connecticut G. Anandalingam

University of Pennsylvania Shoshana Anily

Tel Aviv University Sven Axsater

Lund University Yehuda Bassok

University of Washington David Bernstein

Princeton University Dimitris Bertsimas

Massachusetts Institute of Technology

Michael Bevers USDA Forest Service

Phelim Boyle University of Waterloo

Yavuz Bozer University of Michigan

Julien Bramel Columbia University

Jonathan Caulkins Camegie Mellon University

Cheng-Shang Chang National Tsing-Hua University

Hong Chen University of British Columbia

Sunil Chopra Northwestern University

Jim Dai Georgia Institute of Technology

Werner F. M. DeBondt University of Wisconsin-Madison

Robert D. Doverspike AT&T Labs

Izak Duenyas University of Michigan

Jonathan Eckstein Rutgers University and RUTCOR

Hamilton Emmons Case Western Reserve University

Awi Federgruen Columbia University

Robert Fourer Northwestern University

Guillermo Gallego Columbia University

Yigal Gerchak University of Waterloo

Richard Gibbens Cambridge University

Kevin D. Glazebrook Newcastle University

Irwin Greenberg George Mason University

Peter J. Haas IBM Almaden Research Division

Nicholas G. Hall Ohio State University

Gordon Hazen Northwestern University

Don Eisenstein University of Chicago

Michael C. Fu University of Maryland

Donald W. Hearn University of Florida

Daniel P. Heyman AT&T Labs

Julia L. Higle University of Arizona

Dorit Hochbaum University of California, Berkeley

Ananthanarayanan Iyer Purdue University

Patrick Jaillet University of Texas at Austin

Edward Kaplan Yale University

Offer Kella Hebrew University of Jerusalem

Anton Kleywegt Georgia Institute of Technology

Hiroshi Konno Tokyo Institute of Technology

Martin Labbe Universite Libre de Bruxelles

Janny M. Y. Leung City University of Hong Kong/University

Arizona Benjamin Lev

(Jniversity of Michigan-Dearborn Yi-Hsin Liu

University of Nebraska at Omaha Christopher H. Loch

INSEAD Andrew G. Loerch

Office of the Chief of Staff of the Army William S. Lovejoy

University of Michigan C. A. Knox Lovell

University of Georgia Joseph B. Mazzola

Duke University Kevin F. McCardle

Duke University Michel Minoux

Universite Pierre et Marie Curie Kamran Moinzadeh

University of Washington Renato Monteiro

Georgia Institute of Technology Herbert Moskowitz

Purdue University Stephen Pollock

University of Michigan Evan L. Porteus

Stanford University Guy Pujolle

Universite de Versailles St. Quentin-en-Yvelines

Rhonda Righter Santa Clara University

Randall S. Robinson Meir Rosenblatt

Washington University/Technion Uriel G. Rothblum

Technion/Israel Institute of Technology Susan M. Sanchez

University of Missouri at St. Louis Martin W. P. Savelsbergh

Georgia Institute of Technology J. George Shanthikumar

University of California, Berkeley Prakash P. Shenoy

University of Kansas Hanif Sherali

Virginia Polytechnic Institute and State University

Karl Sigman Columbia University

Matthew J. Sobel Case Western Reserve University

Ariela Sofer George Mason University

Jing-Sheng Song University of California, Irvine

Jaap Srponk Erasmus Universiteit

Ralph E. Steuer University of Georgia

Lawrence Stone Metron, Inc.

Michael R. Taaffe University of Minnesota

Sridhar Tayur Camegie Mellon University

Henk Tijms Vrije Universiteit

Philippe Toint F. U.N.D.P.

Paolo Toth DEIS University of Bologna

Steef van de Velde University of Twente

Garrett Van Ryzin Columbia University

Luis G. Vargas University of Pittsburgh

Janet M. Wagner University of Massachusetts

Alan R. Washburn Naval Postgraduate School

Richard Weber Cambridge University

Gideon Weiss The University of Haifa

Candace Yano University of California, Berkeley

Yu-Sheng Zheng University of Pennsylvania

Heinz Zimmerman Swiss Institute for Banking

and Finance

OR PRACTICE ASSOCIATE EDITORS

Cynthia Barnhart Massachusetts Institute of

Technology James H. Bookbinder

University of Waterloo James R. Bradley

Cornell University Alan Gleit

Huntington Bankshares, Inc. David Hopkins

Pacific Business Group on Health

M. Eric Johnson Vanderbilt University

Pasumarti V. Kamesam IBM T. J. Watson Research Center

Peter A. Morris Applied Decision Analysis, Inc.

David A. Schrady Naval Postgraduate School

Stephen A. Smith Santa Clara University

A Journal of the Institute for Operations Research and the Management Sciences



The mission of Operations Research

is to serve the entire Operations Research (OR)

community, including practitioners, researchers,

educators, and students. Operations Research, as the

flagship journal of our profession, strives to publish

results that are truly insightful. Each issue of

Operations Research attempts to provide a balance

of well-written articles that span the wide array of

creative activities in OR. Thus, the major criteria for

acceptance of a paper in Operations Research are that

the paper is important to more than a small subset

of the OR community, contains important insights,

and makes a substantial contribution to the field

that will stand the test of time.

For more details and up-to-date policies,

please visit our Home Page:

http://opim.wharton.upenn.edu/~harker/opsresearch.html



Date post:	07-Jan-2017
Category:	Documents
Upload:	phungkhue
View:	213 times
Download:	0 times

Back Matter

Documents