The section will consider papers falling in the same areas as Discrete Applied Mathematics, and will essentially publish three kinds of contributions:

1. Regular papers, processed and accepted for their mathematical novelty, for which, in addition, the authors give and describe the corresponding computer codes.
2. Papers presenting significant implementations of algorithms from the literature, provided they are of particular interest to the scientific community. Criteria for acceptance of this kind of contribution will be: high efficiency, proved through extensive computational experiments, significantly improving that of the best existing codes (one order of magnitude is considered to be significant); novelty of the software, when no other code for the same problem is available to the public domain.
3. Papers presenting comparative studies on relevant existing software.

To submit their work, authors are requested:

1. to mail three hard copies of the manuscript to Nelly Segal, Editorial Manager, RUTCOR, Rutgers University, P.O. Box 5062, New Brunswick, NJ 08903-5062, U.S.A., mentioning "Mathematical Software Section" in their covering letter and
2. to send the codes electronically to Professors S. Martello and P. Toth at smartello@deis.unibo.it or ptoth@deis.unibo.it.

The codes must be clean, well documented and self contained. Use of machine-dependent constants and functions should be avoided or, when needed, clearly stated. Each code must contain a main subroutine or procedure which receives all the input data and yields all the output data as parameters. Such a routine must begin with a comments section providing:

• clear description of the domain of applicability
• meaning of each input and/or output parameter
• list of machine dependent constants and functions
• list of the routines composing the codes
• type and structure of all the parameters
• rules for the arrays dimensioning
• meaning of the main internal variables

Indentation is recommended for loops and if-then-else statements. The labels in each routine should be consecutive with constant step. Examples of well-structured codes can be found in Martello and Toth, "Knapsack Problems: Algorithms and Computer Implementations", Wiley, 1990.

Each code must be accompanied by a driver program which:

• defines the input data for one or more sample instances through assignment or input statements (in the latter case, the contents of the input records must be explicitly listed)
• calls the main routine of the code
• prints out the results on a standard unit. (The comments section of the driver program must provide the expected output.)

The codes will be available via a library managed by Elsevier Science through a Web-server at http://www.elsevier.com/locate/dam

Copyright in the articles is held, except where noted, by Elsevier Science. Copyright as well as other proprietary rights in the source code are held by the authors. By submitting the code along with the article, the authors have agreed to permit the readers of Discrete Applied Mathematics the right to use the algorithms for personal and professional research use, but not for any further redistribution, further sub-licensing, or commercial use. All rights are otherwise reserved.