The new journal, Algorithmic Operations Research, is dedicated to bringing out original research papers dealing with algorithmic aspects of optimization problems. Authors are invited to submit research papers for possible publication in the journal. All submissions must be made electronically using the Web site at www.facets.ca/AOR.htm or the mirror site at http://punnen.unbsj.ca/AOR/AOR.htm, where more information on the journal can be obtained.

Algorithmic Operations Research publishes original research papers in the area of operations research and mathematical optimization with an algorithmic focus. The topics of interest include linear programming, integer programming, non-linear programming, combinatorial optimization, semidefinite programming, graph algorithms, approximation algorithms, metaheuristics, online algorithms, randomized algorithms, optimization algorithms in computational molecular biology, medicine and all other application areas. The journal welcomes submissions involving development of algorithms, implementation and testing, theoretical analysis of algorithms, computational complexity, experimental analysis, and application and modeling papers with substantial algorithmic content. Survey papers, short communications, invited software reviews and invited book reviews are also of interest to the journal.

The first issue of the journal is scheduled to appear in January 2006. We are committed to maintain an average processing time for the initial editorial decision of no more than four months, and every effort will be made to complete the initial processing within six months.



E-mail to the Editorial Department of OR/MS Today: orms@lionhrtpub.com




OR/MS Today copyright © 2004 by the Institute for Operations Research and the Management Sciences.
All rights reserved.


Lionheart Publishing, Inc.
506 Roswell Road, Suite 220, Marietta, GA USA
Phone: 770-431-0867 | Fax: 770-432-6969
E-mail: lpi@lionhrtpub.com
Web URL: www.lionhrtpub.com


Web Site © Copyright 2004 by Lionheart Publishing, Inc.
All rights reserved.