Free antivirus programs software for linux

SimpleMail is the easiest e-mail client there is! SimpleMail uses UAP (Unwanted Access Protection) exclusively to SimpleMail that automatically protects you from viruses in e-mails, malicious code in e-mails, and even pictures in spam that my be offensive in content. SimpleMail is compatible with many anti-virus programs, including:

Norton AntiVirus
McAfee VirusScan
Panda Tituanium AntiVirus
AVG AntiVirus (free and professional)
avast! AntiVirus (free and professional)

Normally, you can disable your e-mail protection in your anti-virus, because the UAP technology built in eliminates the need to keep the e-mail protection on.

AntiVirus Scanner is an anti-virus scanner for Endeavour Mark II that uses the ClamAV library (libclamav).

AntiVirus Scanner allows you to create a list of scan items for frequently scanned locations and features easy virus database updating, all in a simple GUI environment.

avpmilter is a sendmail milter interface to the Kaspersky antivirus daemon.
Avpmilter gets virus scan result and tells sendmail MTA to send reject message upon virus detection. This program is not MTA, nor antivirus by itself.

In comparison with will Kasperskys kavkeeper it will improve performance of your mail subsystem because:
It will not reinject each message for each recipient back to sendmail MTA ( if sendmail receives, for example, one message for 30 recipients, kavkeeper will initiate 30 requests to antivirus daemon and 30 additional executions of sendmail program. Avpmilter will send only one request to antivirus daemon and will not initiate additional executions of sendmail program).

Avpmilter is small resident miltithreaded program, thus it avoids expensive fork() calls.
Avpmilter almost does not affects your current sendmail configuration. Moreover milter interface allows to run sendmail MTA and filter on different computers. avpmilter requires sendmail 8.11.x or 8.12.x built with milter support (which is the default option for sendmail 8.12). You can read about how to build and configure sendmail with milter interface in libmilter/README in sendmail source tree. Also you can find a good milter api ocumentation in libmilter/docs directory in version 8.12 of sendmail.

ClamCour software is a multi-threaded filter for the Courier MTA that that scans for viruses using the Clam Antivirus package.

Antivirus Scan with F-Prot is a simple servicemenu for konqueror that allows to scan single or multiple files and folders using the F-Prot Antivirus. Antivirus Scan with F-Prot shows the result of the scanning in a textbox using kdialog. It can also show the progress of the scanning in a terminal.
I hope you may find it useful.
Comments or/and translations are welcome.
TO INSTALL: extract the content of the tarball and copy the file f-prot_virus_scan.desktop into ~/.kde/share/apps/konqueror/servicemenus (just for your user) or in /usr/share/apps/konqueror/servicemenus, /opt/kde/share/apps/konqueror/servicemenus... etc, depending on your distro, to make it system-wide.
This is only the service-menu, you need to have F-Prot antivirus installed on your system.
Enhancements:
- Added Danish translation by Kefeus

Solving Constraint Integer Programs is a framework for constraint integer programming. For solving Integer Programs and Constraint Programs, a very similar technique is used: the problem is successively divided into smaller subproblems (branching) that are solved recursively.
On the other hand, Integer Programming and Constraint Programming have different strengths: Integer Programming uses LP relaxations and cutting planes to provide strong dual bounds, while Constraint Programming can handle arbitrary (non-linear) constraints and uses propagation to tighten the variables domains.
SCIP is a framework for Constraint Integer Programming oriented towards the needs of Mathematical Programming experts who want to have total control of the solution process and access detailed information down to the guts of the solver. SCIP can also be used as pure MIP solver or as framework for branch-cut-and-price.
Main features:
- It is a framework for branching, cutting, pricing, and propagation.
- It is highly flexible through many possible user plugins:
- constraint handlers to implement arbitrary constraints,
- variable pricers to dynamically create problem variables,
- domain propagators to apply constraint independent propagations on the variables domains,
- cut separators to apply cutting planes on the LP relaxation,
- relaxators to provide relaxations and dual bounds in addition to the LP relaxation,
- primal heuristics to search for feasible solutions with specific support for probing and diving,
- node selectors to guide the search,
- branching rules to split the problem into subproblems,
- presolvers to simplify the solved problem,
- file readers to parse different input file formats,
- event handlers to be informed on specific events, e.g., when a node was solved, a specific variable changed its bounds, or a new primal solution was found,
- display handlers to create additional columns in the solvers output.
- dialog handlers to extend the included command shell.
- Every existing unit is implemented as a plugin, leading to an interface flexible enough to meet the needs of most additional user extensions.
- A dynamic cut pool management is included.
- The user may mix preprocessed and active problem variables in expressions: they are automatically transformed to corresponding active problem variables.
- Arbitrarily many children per node can be created, and the different children can be arbitrarily defined.
- It has an open LP solver support (currently supporting ILOG CPLEX, Dash XPress-MP, SoPlex, and CLP.
- The LP relaxation need not to be solved at every single node (it can even be turned off completely, mimicing a pure constraint solver).
- Additional relaxations (e.g., semidefinite relaxations or Lagrangian relaxations) can be included, working in parallel or interleaved.
- Conflict analysis can be applied to learn from infeasible subproblems.
- Dynamic memory management reduces the number of operation system calls with automatic memory leakage detection in debug mode.
Enhancements:
- The new heuristics "RENS", "mutation", "veclendiving", and "intshifting", were included.
- The existing ones were improved.
- Presolving and c-MIR cut generation were improved.
- A few bugs were fixed.