Horde Groupware is an enterprise ready browser-based collaboration suite. Users can manage and share calendars, contacts, tasks, and notes with the standards compliant components from the Horde Project. Horde Groupware bundles the separately available applications Kronolith, Turba, Nag, and Mnemo. It can be extended with any of the released Horde applications or the Horde modules that are still in development, like a file manager, a bookmark manager, a forum, or a wiki.
Horde Groupware Webmail Edition is an enterprise ready browser-based communication suite. Users can read, send, and organize email messages and manage and share calendars, contacts, tasks, and notes with the standards compliant components from the Horde Project. It bundles the separately available applications IMP, Ingo, Kronolith, Turba, Nag, and Mnemo. It can be extended with any of the released Horde applications or the Horde modules that are still in development, like a file manager, a bookmark manager, a forum, or a wiki.
HERMES is a Web application framework designed to help provide a rapid application development framework for business tools with an initial focus of CRM (application included). It provides an integrated and flexible approach to business tools, and allows for database abstraction, library models, user rights management, and other critical areas.
Foswiki is wiki software, supporting the editing of Web pages in an ordinary Web browser by end users. What makes Foswiki special is that it supports the embedding of active and passive macros that enhance the page content (e.g. with global or dynamic information) and allow end-users to build applications that store and process data in a structured manner.
Java iCal Group Scheduler enables several users to get together for a meeting, by using JICAL to translate their iCalendar files into their available free/busy time and post it automatically to your Web server. This project enables Ximian Evolution desktop users to book meetings with each other (and Outlook users) via a Web server storing their 'Free/Busy' information as specified in RFC2445. It works with Evolution, Korganiser, Apple iCal, and MS Outlook (for meetings), and enhances your workgroup and personal calendar views. Shell scripts for converting to various image formats are also included.
iCalcreator is a PHP implementation to create, parse, select, and edit iCal calendar files for non-calendar systems like CMS, project management systems, and other applications able to support calendar information like agendas, tasks, reports, todo lists, and journaling data, and able to communicate with calendar applications. iCalcreator features the ability to create, parse, edit, and select calendars and calendar components. It is composed of a single class file with a simple interface, and is oriented around iCal calendar component properties.
JOpt.SDK is an automated vehicle routing and dispatching component for both Java/J2SE and .NET. It can solve Travelling Salesman Problems (TSP) and Capacitated Vehicle Routing Problems with Time Windows (CVRP,VRPTW). It offers route and transport optimisation with respect to various constraints such as time windows, load capacities, and prescribed itinerary. The component is based on genetic algorithms, and automatically determines an optimized allocation of vehicels to an arbitrary set of orders.
SyncML is the common language for synchronizing all devices and applications over any network. SyncML leverages eXtensible Markup Language (XML), making SyncML a truly future-proof platform. With SyncML, networked information can be synchronized with any mobile device, and mobile information can be synchronized with any networked applications. SyncML is an open standard.
METSlib is an object-oriented metaheuristics framework in C++ designed to make implementing or adapting models easy. The model is modular: all the implemented search algorithms can be applied to the same model. METSlib implements the basics of some metaheuristics algorithms, such as Random Restart Local Search, Variable Neighborhood Search, Iterated Local Search, Simulated Annealing, and Tabu Search. For each algorithm, you must implement an objective function, a neighborhood (move manager), and some moves. Tabu Search is one of the fastest ways to generate near-optimal solutions to a wide range of hard combinatorial optimization problems.