Program sources for all code used in the work and developed by the authors is required for refereeing; if the authors' employer does not allow the release of such codes to the public, the referees will review the source under a non-disclosure policy. (Authors are strongly encouraged to exert themselves to convince their employers to release their codes to the public, in order to further research.)
The preferred programming language is C or C++. Any other language requires some justification (several research communities have a tradition of using Lisp or FORTRAN, for instance, in which case such codes are entirely suitable). The authors should consider that part or all of their code may be embedded within some larger program and thus should choose names for variables, functions, or classes that are not likely to conflict with names used in that larger program; JEA editors recommend that all names that could give rise to external conflicts be prefixed by several characters likely to be unique to the authors or to their project.
The codes provided must be complete and must be buildable on some type of Unix platform; platforms acceptable at present include AIX, Ultrix, HP-UX, Irix, SunOS, Solaris, and Linux. If the authors do not have access to any of these platforms, they may request the editor to provide access to one -- for the sole purpose of making their codes buildable on that system. The referees will verify that the code package is buildable on the system(s) indicated by the authors and that the resulting binaries produce (some of) the results provided in the submission.
Data files and test generators should be clearly identified, preferably by placing them in a separate directory prio to creating a tape archive for submission. Whenever possible, authors should use data formats already in widespread use in the community; in any case, if a suitable format already exists at the JEA site, authors should use it. (Current examples of widely accepted formats include graph and network formats used in the DIMACS Challenge, formats for the Travelling Salesperson problem, and formats for linear programming problems.)