图书馆主页
数据库简介
最新动态
联系我们



返回首页


 刊名字顺( Alphabetical List of Journals):

  A|B|C|D|E|F|G|H|I|J|K|L|M|N|O|P|Q|R|S|T|U|V|W|X|Y|Z|ALL


  检 索:         高级检索

期刊名称:COMPUTERS & OPERATIONS RESEARCH

ISSN:0305-0548
出版频率:Monthly
出版社:PERGAMON-ELSEVIER SCIENCE LTD, THE BOULEVARD, LANGFORD LANE, KIDLINGTON, OXFORD, ENGLAND, OX5 1GB
  出版社网址:http://www.elsevier.com/wps/find/homepage.cws_home
期刊网址:http://www.journals.elsevier.com/computers-and-operations-research/#description
影响因子:4.008
主题范畴:COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS;    ENGINEERING, INDUSTRIAL;    OPERATIONS RESEARCH & MANAGEMENT SCIENCE

期刊简介(About the journal)    投稿须知(Instructions to Authors)    编辑部信息(Editorial Board)   



About the journal

 

 

Operations research and computers meet in a large number of scientific fields, many of which are of vital current concern to our troubled society. These include, among others, ecology, transportation, safety, reliability, urban planning, economics, inventory control, investment strategy and military analysis. This journal provides an international forum for the application of computers and operations research techniques to problems in these and related fields.
The common element in all these scientific areas which this journal addresses is the methodology for determining viable solutions to problems using computers and the techniques of operations research. However, it is not only the mathematical methodology which is of interest. The applications are of equal importance and the two are mutually supportive since understanding the application helps one greatly to comprehend the mathematical methods used and vice versa. The journal will therefore concern itself with these scientific fields of application and will be accordingly broad in scope of subject matter. The form, content and language of the articles will take cognizance of this breadth of applications and of the consequent fact that many readers may not be expert in the particular scientific field to which the computer and operations research techniques are applied by the author. This journal will also publish articles containing interesting applications even though there may be no new techniques involved. These should be labeled as case studies. It is important that they be actual cases of interest and significance which the authors were asked to analyze.
The content and presentation of this international journal is such as to provide maximum utility to researchers, teachers and practitioners who have an interest in operations research, computers and the subject matter of the fields of application served by these. Tutorial and state-of-the-art papers will be presented from time to time as deemed suitable and emphasis will be given to those science areas of public importance in which significant advances are being made by means of computers and operations research. When appropriate, the journal will also include comments from its readers on the journal articles, and discussions of significant work in progress or papers presented or published elsewhere. Special features to be included from time to time include descriptions of computer programs which may be of immediate value to researchers. These programs will be tabulated in adequate detail for immediate use.

Focused Issues
Computers & Operations Research publishes focused issues on topics of interest related to its editorial mission. Such issues typically contain between six and twelve articles. They are put together within an eighteen month period under the responsibility of one or several guest editors. Any contribution submitted by a guest editor is handled by the Editor of C&OR. Prospective guest editors are encouraged to contact the Editor, Professor Gilbert Laporte gilbert@crt.umontreal.ca.

 


Instructions to Authors

 

Content
Computers & Operations Research is a journal intended for a diverse audience, many of whom will understand what it is you are trying to do and what you have accomplished only if you make a specific effort to reach them. We ask the authors to talk the readers verbally through derivations, examples and illustrations, and before launching into complex mathematics, inform the reader where you are heading and why. In addition to adhering to these general guidelines, a paper submitted to Computers & Operations Research must specifcally demonstrate significant content in both OR and computing. Development and/or application of OR methodologies will typically provide the OR content.The computing content will be established either through theoretical analyses such as those related to problem and algorithm complexities and heuristic performance, or through direct computer usage for purposes such as computational experimentation and practical problem solving.

Submission of Papers
Submission in electronic form to gilbert@crt.umontreal.ca is encouraged. Otherwise authors are requested to submit three copies of their manuscript and figures to the Editorial office:
Gilbert Laporte,
Centre de recherche sur les transports,
Universite de Montréal,
P.O. Box 6128,
Station Centre-ville Montréal,
Canada H3C 3J7.

Address for courier deliveries only:
Gilbert Laporte,
Centre de recherche sur les transports,
Pavillon Andr?Aisenstadt,
suite 3520,
2920 chemin des Services,
Campus de l'Universit?de Montréal
Montréal, Canada H3T 1J4.
Submission of a paper implies that it has not been published previously, that it is not under consideration for publication elsewhere, and that if accepted it will not be published elsewhere in the same form, in English or in any other language, without the written consent of the publisher.

Manuscript Preparation
General: Manuscripts must be typewritten, doublespaced with wide margins on one side of white paper. Good quality printouts with a font size of 12 or 10 pt are required. The corresponding author should be identified (include a Fax number and E-mail address). Full postal addresses must be given for all co-authors.
Authors should consult a recent issue of the journal for style if possible. An electronic copy of the paper should accompany the final version. The Editors reserve the right to adjust style to certain standards of uniformity. Authors should retain a copy of their manuscript since we cannot accept responsibility for damage or loss of papers. Original manuscripts are discarded one month after publication unless the Publisher is asked to return originalmaterial after use.

Abstracts: An abstract should accompany the manuscript on a separate sheet and should be half a typewritten page or less.

Text: Follow this order when typing manuscripts: Title, Authors and their a!iliations, Statement of Scope and purpose, Abstract, Keywords, Main text, Acknowledgements, Appendix, References, Vitae, Figure Captions and thenTables. Do not import the Figures or Tables into your text. The corresponding author should be identified with an asterisk and footnote. All other footnotes (except for table footnotes) should be identified with superscriptArabic numbers.

Abbreviations: Because of the international character of the journal, no rigid rules concerning notation or abbreviation need to be observed by the authors but each paper should be self-consistent as to symbols and units which should be properly defined.

Symbols: All mathematical symbols should be typewritten. Greek letters and unusual symbols should be identified in the margin. Distinction should be made between capital and lower case letters; between the letter O and zero; between the letter l, and the number one and prime; between k and kappa. A vector will be printed bold face and to indicate this the letter should be underscored with a single wavy line. The numbers identifying mathematical expressions should be placed in parentheses after the equation.

References: All publications cited in the text should be presented in a list of references following the text of the manuscript. In the text refer to references by a number in square brackets on the line (e.g. Since Tu [1]).

References should be in the following style: 1. Tu C-C, Cheng H. Spectral methods for graph bisection problems. Comp. Oper Res 1998;25(7-8): 519-30.

2. Karp RM. Reducibility among combinatorial problems. In: Miller RE, Thatcher JW (Eds.). Complexity of computer computations. New York: Plenum Press, 1992. p. 85-103.

3. Magazine M. Optimal policies for queueing systems with periodic review. Disertation, University of Florids, USA,1969.

 


Editorial Board
 
Editor
G. Laporte, HEC, Montréal, Canada. Email: gilbert@crt.umontreal.ca
Founding Editor:
Samuel J. Raff, USA
Editorial Advisory Board:
V.A. Armentano, Universidade Estadual de Campinas, Brazil
J.R. Artalejo, Complutense University of Madrid, Spain
N. Balakrishnan, Clemson University, SC, USA
J.F. Bard, University of Texas at Austin, USA
R. Barkhi, Virginia Polytechnic Institute and State University, VA, USA
M. Bastian, RWTH, Aachen, Germany
R. Batta, SUNY at Buffalo, NY, USA
J.E. Beasley, Imperial College, London, UK
O. Berman, University of Toronto, Canada
F. Boctor, Universit?Laval, Québec, Canada
R.L. Bulfin, Auburn University, AL, USA
T. Cavalier, Penn State University, PA, USA
S.S. Chaudhry, Villanova University, PA, USA
T.C.E. Cheng, Hong Kong Polytechnic
B.W Conolly, Cambridge University, UK
W.D. Cook, York University, Toronto, Canada
A. Corberán, University of Valencia, Spain
J.-F. Cordeau, Ecole des Hautes Etudes Commerciales, Montréal, Canada
N. Curet, National Security Agency, MD, USA
J.R. Current, Ohio State University, Columbus, OH, USA
R.F. Deckro, Air Force Institute of Technology, OH, USA
M. Dror, University of Arizona, TX, USA
F.F. Easton, Syracuse University, NY, USA
R. Eglese, Lancaster University, UK
H.A. Eiselt, University of New Brunswick, Canada
E.A. Elsayed, Rutgers University, NJ, USA
E. Erkut, University of Alberta, Edmonton, Canada
E. Fernández, University Politecnica de Catalunya, Barcelona, Spain
W.G. Ferrell, Clemson University, SC, USA
J.O. Frendewey, Michigan Technological University, MO, USA
S.I. Gass, University of Maryland, MD, USA
P. Ghandforoush, Virginia Polytechnic Institute & State University, VA, USA
G. Ghiani, University di Lecce, Italy
B. Golden, University of Maryland, MD, USA
J.N.D. Gupta, The University of Alabama in Huntsville, AL, USA
M. Hanna, University of Houston-Clear Lake, TX, USA
M. Hariga, King Saud University, Riyadh, Saudi Arabia
A. Hertz, École Polytechnique de Montreal, Quebec, Canada
J.P. Ignizio, Intel Corporation, Placitas, NM, USA.
R.J.W. James, University of Canterbury, Christchurch, New Zealand
M.H. Karwan, SUNY at Buffalo, NY, USA
R.K. Kincaid, College of William and Mary, VA, USA
L. LaForge, Clemson University, SC, USA
K.D. Lawrence, New Jersey Institute of Technology, NJ, USA
R. Levary, St Louis University, MO, USA
S. Lipovetsky, Custom Research Inc., Minneapolis, MN, USA
C. Madu, LGSB Pace University, NY, USA
B. Malakooti, Case Western Reserve University, OH, USA
R.D. McBride, University of Southern California, CA, USA
P. McKeown, University of Georgia, GA, USA
H.I. Mesak, Louisiana Tech University, LA, USA
J. Min, Iowa State University, Ames, IA 50011, USA
J. Mittenthal, University of Alabama, AL, USA
A. Mukherjee, University of West Florida, Pensacola, FL, USA
R.A. Murphy, Integrated Decision Support Corporation, Richardson, TX, USA
R. Musmanno, University Della Calabria, Rende, Italy
S. Nickel, Fraunhofer Institute for Industrial Mathematics, Kaiserlautern, Germany
K.-M. Osei-Bryson, Virginia Commonwealth University, VA, USA
J.-Y. Potvin, University de Montréal, Canada
C.T. Ragsdale, Virginia Polytechnic Institute, VA, USA
A. Ravindran, Pennsylvania State University, PA, USA
T. Raz, Leon Recanti Graduate School of Business Administration, Israel
G. Reeves, University of South Carolina, SC, USA
J. Ringuest, Boston College, MA, USA
D.J. Robb, The University of Auckland, New Zealand
D.F. Rogers, University of Cincinnati, OH, USA.
R. Santhanam, University of Kentucky, KY, USA
B.R. Sarker, Louisiana State University, Baton Rouge, LA, USA
M. Schniederjans, University of Nebraska, CO, USA
F. Semet, University de Valenciennes, France
J.K. Sengupta, University of California, CA, USA
H.D. Sherali, Virginia Polytechnic Institute & State University, VA, USA
D.K. Smith, University of Exeter, UK
K.A. Smith, Monash University, Australia
R. Solanki, Flower Mound, TX, USA
F.C.R. Spieksma, Katholieke Universiteit Leuven, Belgium
R.T. Sumichrast, Virginia Polytechnic Institute & State University, VA, USA
B.W. Taylor III, Virginia Polytechnic Institute & State University, VA, USA
E. Triantaphyllou, Louisiana State University, LA, USA
R. Vetschera, University of Vienna, Austria
A. Volgenant, University of Amsterdam, The Netherlands
P.P. Wang, University of Alabama, Tuscaloosa, AL, USA
H.-M. Wee, Chung Yuan Christian University, Taiwan
H.J. Weiss, Temple University, PA, USA
Ue-Pyng Wen, National Tsing Hua University, Taiwan

R.J. Willis, Monash University, Australia
E.P. Winkofsky, Mead School & Office Products, OH, USA


 返回页首 


邮编:430072   地址:中国武汉珞珈山   电话:027-87682740   管理员Email:
Copyright © 2005-2006 武汉大学图书馆版权所有